For this Question: Given a string S and a pattern P both of lowercase characters. The task is to check if the given pattern P exists in the given string S or not.First line of input contains number of testcases T. For each testcase, first line will the string and second line will be the pattern to be searched.

Constraints:
1 <= T <= 100
1 <= |S|, |P| <= 1000For each testcase, print "Yes" if pattern exists or "No" if doesn't.Input:
2
aabaacaadaabaaabaa
aaba
aabaacaadaabaaabaa
ccda

Output:
Yes
No

Explanation:
Testcase 1: Given pattern aaba is found in the string at index 0.
Testcase 2: Given pattern ccda doesn't exists in the string at all., I have written this Solution Code: import java.io.*;
import java.util.*;



class Main {
	public static void main (String[] args) throws IOException {
    BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
	int testcases=Integer.parseInt(br.readLine());

    for(int i=0;i<testcases;i++)
    {
        String input=br.readLine();
        String pattern=br.readLine();

       if(input.indexOf(pattern)>=0)
       System.out.println("Yes");
       else
        System.out.println("No");

    }



    }
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?