description: You have a string s and a chip, which you can place onto any character of this string. 
  
  After placing the chip, you move it to the right several (maybe zero) times, i. e. you perform the following operation several times: if the current position of the chip is i, you move it to the position i + 1. Of course, moving the chip to the right is impossible if it is already in the last position.
  
  After moving the chip to the right, you move it to the left several (maybe zero) times, i. e. you perform the following operation several times: if the current position of the chip is i, you move it to the position i - 1. Of course, moving the chip to the left is impossible if it is already in the first position.
  
  When you place a chip or move it, you write down the character where the chip ends up after your action. For example, if s is abcdef, you place the chip onto the 3-rd character, move it to the right 2 times and then move it to the left 3 times, you write down the string cdedcb.
  
  You are given two strings s and t. Your task is to determine whether it's possible to perform the described operations with s so that you write down the string t as a result.
  
  Input
  
  The first line contains one integer q (1 ≤ q ≤ 500) — the number of test cases.
  
  Each test case consists of two lines. The first line contains the string s (1 ≤ |s| ≤ 500), the second line contains the string t (1 ≤ |t| ≤ 2 ⋅ |s| - 1). Both strings consist of lowercase English characters.
  
  It is guaranteed that the sum of |s| over all test cases does not exceed 500.
  
  Output
  
  For each test case, print "YES" if you can obtain the string t by performing the process mentioned in the statement with the string s, or "NO" if you cannot.
  
  You may print each letter in any case (YES, yes, Yes will all be recognized as positive answer, NO, no and nO will all be recognized as negative answer).
  
  Example
  
  Input
  
  
  6
  abcdef
  cdedcb
  aaa
  aaaaa
  aab
  baaa
  ab
  b
  abcdef
  abcdef
  ba
  baa
  
  
  Output
  
  
  YES
  YES
  NO
  YES
  YES
  NO
  
  Note
  
  Consider the examples.
  
  The first test case is described in the statement.
  
  In the second test case, you can place the chip on the 1-st position, move it twice to the right, and then move it twice to the left.
  
  In the fourth test case, you can place the chip on the 2-nd position, and then don't move it at all.
  
  In the fifth test case, you can place the chip on the 1-st position, move it 5 times to the right, and then finish the process.
solution: 
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.io.BufferedReader;
  import java.util.*;
  
  
  
  import java.math.*;
  import java.io.*;
  import java.text.*;
  import java.math.BigInteger;
  public class Main {
  
  	static class pair implements Comparable<pair>{
  	long x;
  		long y;
  		public pair(long x,long y) {
  			this.x=x;
  			this.y=y;
  		}
  		
  		public int compareTo(pair o) {
  			if(this.x<o.x) {
  				return -1;
  			}else if(this.x>o.x) {
  				return 1;
  			}else {
  				return -1;
  			}
  			
  			
  		}
  		
  	}
  	 public static ArrayList<Integer> sieve(long n)
  	    {
  	        boolean[] prime = new boolean[(int)n+1];
  	        Arrays.fill(prime,true);
  	        prime[0] = false;
  	        prime[1] = false;
  	        long m = (long)Math.sqrt(n);
  	        for(int i=2;i<=m;i++)
  	        {
  	            if(prime[i])
  	            {
  	                for(int k=i*i;k<=n;k+=i)
  	                {
  	                    prime[k] = false;
  	                }
  	            }
  	        }
  	        ArrayList<Integer>l=new ArrayList<>();
  	        for(int j=2;j<=n;j++) {
  	        	if(prime[j]) {
  	        		l.add(j);
  	        	}
  	        
  	        }
  	        
  	        return l;
  	    } 
  	public static void sort(long arr[], int l, int r)
  	    {
  	        if (l < r)
  	        {
  	            // Find the middle point
  	            int m = (l+r)/2;
  	 
  	            // Sort first and second halves
  	            sort(arr, l, m);
  	            sort(arr , m+1, r);
  	 
  	            // Merge the sorted halves
  	            merge(arr, l, m, r);
  	        }
  	    }
  	 
  	 
  	public static void merge(long arr[], int l, int m, int r)
  	    {
  	        // Find sizes of two subarrays to be merged
  	        int n1 = m - l + 1;
  	        int n2 = r - m;
  	 
  	        /* Create temp arrays */
  	        long L[] = new long[n1];
  	        long R[] = new long[n2];
  	 
  	        //Copy data to temp arrays
  	        for (int i=0; i<n1; ++i)
  	            L[i] = arr[l + i];
  	        for (int j=0; j<n2; ++j)
  	            R[j] = arr[m + 1+ j];
  	 
  	 
  	        /* Merge the temp arrays */
  	 
  	        // Initial indexes of first and second subarrays
  	        int i = 0, j = 0;
  	 
  	        // Initial index of merged subarry array
  	        int k = l;
  	        while (i < n1 && j < n2)
  	        {
  	            if (L[i] <= R[j])
  	            {
  	                arr[k] = L[i];
  	                i++;
  	            }
  	            else
  	            {
  	                arr[k] = R[j];
  	                j++;
  	            }
  	            k++;
  	        }
  	 
  	        /* Copy remaining elements of L[] if any */
  	        while (i < n1)
  	        {
  	            arr[k] = L[i];
  	            i++;
  	            k++;
  	        }
  	 
  	        /* Copy remaining elements of R[] if any */
  	        while (j < n2)
  	        {
  	            arr[k] = R[j];
  	            j++;
  	            k++;
  	        }
  	    }
  	 
  	 
  	 public static boolean[] primeseive(long n) {
  		 boolean prime[]=new boolean[(int)n+1];
  		 
  		 Arrays.fill(prime, true);
  		 
  		 prime[0]=false;
  		 prime[1]=false;
  		 
  		 int m=(int) Math.sqrt(n);
  		 
  		 for(int i=2;i<=m;i++) {
  			 if(prime[i]) {
  				 
  				 for(int k=i*i;k<=n;k+=i) {
  					 prime[k]=false;
  				 }
  			 }
  		 }
  		 
  		 return prime;
  	 }
  	 public static String reverse(String input)
  	 {
  	   StringBuilder str  = new StringBuilder("") ;
  	    
  	     for(int i =input.length()-1 ; i >= 0  ; i-- )
  	     {
  	         str.append(input.charAt(i));
  	     }
  	     
  	 return str.toString() ;
  	 }
  	 
  	 public static ArrayList<Integer> allFactors(int n)
  	 {   
  	       ArrayList<Integer> list = new ArrayList<>() ;
  	       
  	     for(int i = 1; i*i <= n ;i++)
  	     {
  	           if( n % i == 0)
  	           {
  	               if(i*i == n)list.add(i) ;
  	               else{ 
  	          list.add(i);
  	               list.add(n/i); 
  	               }
  	           }
  	     }
  	       
  	      return list ; 
  	 }
  	  
  	  
  	 public static ArrayList<Long> allFactors(long n)
  	 {   
  	       ArrayList<Long> list = new ArrayList<>() ;
  	       
  	     for(long i = 1L; i*i <= n ;i++)
  	     {
  	           if( n % i == 0)
  	           {
  	               if(i*i == n) list.add(i) ;
  	               else{  list.add(i) ; list.add(n/i) ; }
  	              
  	           }
  	     }
  	       
  	      return list ; 
  	 }
  	 
  	 
  	   
  //////////////////////////////////////////////////////////////////////////////////
  
  /*
  lowerBound - finds largest element equal or less than value paased
  upperBound - finds smallest element equal or more than value passed
  if not present return -1;
  */
  
  public static long lowerBound(long[] arr,long k)
  {
  long ans=-1;
  
  int start=0;
  int end=arr.length-1;
  
  while(start<=end)
  {
    int mid=(start+end)/2;
     if(arr[mid]<=k){
    ans=arr[mid];
    start=mid+1;
  
    }
  else{
         end=mid-1;
    }
  
  }
  
    return ans;
  
  }
  
  public static int lowerBound(int[] arr,int k)
  {
  int ans=0;int start=0;int end=arr.length-1;
  
  while(start<=end)
  {
  int mid=(start+end)/2;
  
  if(arr[mid]<=k)
  {
  ans=mid;
  start=mid+1;
  }
  else
  {
  end=mid-1;
  }
  
  }
  
  return ans;
  
  }
  
  
  public static long upperBound(long[] arr,long k)
  {
  long ans=-1;int start=0;int end=arr.length-1;
  
  while(start<=end)
  {
  int mid=(start+end)/2;
  
  if(arr[mid]>=k)
  {
  ans=mid;
  end=mid-1;
  }
  else
  {
  start=mid+1;
  }
  
  }
  
  return ans;
  }
  
  
  public static int upperBound(int[] arr,int k)
  {
  int ans=arr.length-1; int start=0; 	int end=arr.length-1;
  
  while(start<=end)
  {
  int mid=(start+end)/2;
  
  if(arr[mid]>=k)
  {
  ans=mid;
  end=mid-1;
  }
  else
  {
  start=mid+1;
  }
  
  }
  
  return ans;
  }
  
  ////////////////////////////////////////////////////////////////////////////////////////
  //////////////////////////////////////////////////////////////////////////////////////////
  
  	 
  	    
  	    static long GCD(long k,long arr)
  	    {
  	        if(arr==0)
  	        {
  	            return k;
  	        }
  	        return GCD(arr,k%arr);
  	    }
  	 
  	    
  	    
  	    static long gcdnik(long a,long b)
  	    {
  	        if(b==0)
  	        {
  	            return a;
  	        }
  	        return gcdnik(b,a%b);
  	    }
  	    
  	    
  	    static long CountCoPrimes(long n)
  	    {
  	        long res = n;
  	        for(int i=2;i*i<=n;i++)
  	        {
  	            if(n%i==0)
  	            {
  	                while(n%i==0)
  	                {
  	                    n/=i;
  	                }
  	                res-=res/i;
  	            }
  	        }
  	        if(n>1)
  	        {
  	            res-=res/n;
  	        }
  	        return res;
  	    }
  	 
  	 
  	    
  	 
  	    
  	 
  	    static boolean prime(int n)
  	    {
  	        for(int i=2;i*i<=n;i++)
  	        {
  	            if(i%2==0 ||i%3==0)
  	            {
  	                return false;
  	            }
  	        }
  	        return true;
  	    }
  
  	static int length(int len) {
  		
  		if(len==1) {
  			return 1;
  		}
  		else if(len==2) {
  			return 3;
  		}
  		else if(len==3) {
  			return 6;
  		}
  		else if(len==4) {
  			return 10;
  		}
  		return 0;
  	}
  	
  	
  public static int LargestFour(int arr[]) {
  	Arrays.sort(arr);
  
  	int n=arr.length;
  	int count=0;
  	int sum=0;
  	for(int i=n-1;i>=1;i--) {
  		sum+=arr[i];
  	
  			count++;
  			if(count==4) {
  				break;
  			
  		}
  		
  	}
  	
  	if(count<4) {
  		sum+=arr[0];
  	}
  	
  	return sum;
  }
  //Nikunj Gupta
  public static void insertionSort(int array[]) {  
      int n = array.length;  
      for (int j = 1; j < n; j++) {  
          int key = array[j];  
          int i = j-1;  
          while ( (i > -1) && ( array [i] > key ) ) {  
              array [i+1] = array [i];  
              i--;  
          }  
          array[i+1] = key;  
      }  
  } 
  
  
  
    static String solve23(int n) {
  int k=0;
  while(true) {
  	if(n-2020*k<0) {
  		return "NO";
  	}
  	if((n-2020*k)%2021==0) {
  		return "YES";
  	}
  	k++;
  }
  	  
  	
  	}
    public static String swapString(String a, int i, int j) {  
        char[] b =a.toCharArray();  
        char ch;  
        ch = b[i];  
        b[i] = b[j];  
        b[j] = ch;  
        return String.valueOf(b);  
    }  
  	public static void permutation(String str,int start,int end,ArrayList<String> l,Set<String>set) {
  		
  		if(start==end-1) {
  			set.add(str);
  		}
  		
  		for(int i=start;i<end;i++) {
  			str=swapString(str,start,i);
  		
  		permutation(str,start+1,end,l,set);
  		
  		swapString(str,start,i);
  		
  		}
  		
  		
  		
  	}
  
  
  public static boolean solution(int j) {
  	String str=Integer.toString(j);
  	int zero=0;
  	int one=0;
  	for(int i=0;i<str.length();i++) {
  		if(str.charAt(i)=='7') {
  			one++;
  		}else if(str.charAt(i)=='4') {
  			zero++;
  		}
  	}
  	
  	
  	if(one==zero) {
  		return true;
  	}
  	
  	
  return false;
  }
  	
  	
  	
  
  public static int lower_bound(ArrayList<Long> ar,long k)
  {
      int s=0;
      int e=ar.size();
      while (s !=e)
      {
          int mid = s+e>>1;
          if (ar.get(mid) <k)
          {
              s=mid+1;
          }
          else
          {
              e=mid;
          }
      }
      if(s==ar.size())
      {
          return ar.size()-1;
      }
      return s;
  } private static void printsubsequences(String c, String st) {
  	// TODO Auto-generated method stub
  	
  	 
  	 if(c.length()==0) {
  		 System.out.println(st);
  		 return;
  	 }
  	 
  	 
  	 printsubsequences(c.substring(1),st+c.charAt(0));
  	 printsubsequences(c.substring(1),st);
  	 
  	 
  }
  
  private static boolean compare(HashMap<Character, Integer> smap, HashMap<Character, Integer> pmap) {
  		// TODO Auto-generated method stub
  	 
  	 for(char ch:smap.keySet()) {
  		 if(smap.get(ch)!=pmap.get(ch)) {
  			 return false;
  		 }
  	 }
  		return true;
  	}
  
  
  private static boolean BinarySearch(int search, int[] val, int n)
   {
  		// TODO Auto-generated method stub
  		
  	 int start=0;
  	 int end=val.length-1;
  	 while(start<=end) {
  		 int mid=(start+end)/2;
  		 
  		 
  		 if(val[mid]==search) {
  			 return true;
  		 }
  		 else if(val[mid]<search) {
  			 start=mid+1;
  		 }
  		 else {
  			 end=mid-1;
  		 }
  		 
  	 }
  	 return false;
  	 }
  
  
  	
   
  
  	   
  	 
  	   
  
  	    static long re(long n)
  	    {
  	        n+=1;
  	        while(n%10==0)
  	        {
  	            n/=10;
  	        }
  	        return n;
  	    }
  	   static long xor(long n)
  	    {
  	 
  	        if(n%4==0)
  	        {
  	            return n;
  	        }
  	        if(n%4==1)
  	        {
  	            return  1;
  	        }
  	        if(n%4==2)
  	        {
  	            return n+1;
  	        }
  	        return 0;
  	    }
  	 
  	    static long xor(long a,long b)
  	    {
  	        return xor(b)^xor(a-1);
  	    }
  	 
  	 	    static void swap(char c,char p)
  	    {
  	        char t = c;
  	        c = p;
  	        p = t;
  	    }
  	 
  	    static long max(long n,long m)
  	    {
  	        return Math.max(n,m);
  	    }
  	    static long min(long n,long m)
  	    {
  	        return Math.min(n,m);
  	    }
  	 
   	    static int abs(int n)
  	    {
  	        return Math.abs(n);
  	    }
  	 
  	    static class Scanner 
  	    {
  	        StringTokenizer st;
  	        BufferedReader br;
  	 
  	        public Scanner(InputStream s){  br = new BufferedReader(new InputStreamReader(s));}
  	 
  	        public String next() throws IOException 
  	        {
  	            while (st == null || !st.hasMoreTokens()) 
  	            {
  	                st = new StringTokenizer(br.readLine());
  	            }
  	            return st.nextToken();
  	        }
  	 
  	        public int nextInt() throws IOException {return Integer.parseInt(next());}
  	        
  	        public long nextLong() throws IOException {return Long.parseLong(next());}
  	 
  	        public String nextLine() throws IOException {return br.readLine();}
  	 
  	        public boolean ready() throws IOException {return br.ready();}
  	 
  	 
  	    }
  	 
  
  public static void pairsort(ArrayList<pair>l){
  	
  	l.sort(new Comparator<pair>() {
  		public int compare(pair o1,pair o2) {
  			if(o1.x>o2.x) {
  				return 1;
  			}else {
  				return -1;
  			}
  		}
  	});
  
  }
  
  
  static class death implements Comparator<pair>{
  	
  	public int compare(pair o1,pair o2) {
  		if(o1.x<o2.x) {
  			return -1;
  		}
  		
  		else if(o1.x>o2.x) {
  			return 1;
  		}
  		else {
  			return 1;
  		}
  		
  	}
  	
  }
  
  
  public static int[] findRedundantConnection(int[][] edges) {
   
  	HashMap<Integer,HashSet<Integer>>hm=new HashMap<>();
  
  for(int i=1;i<=edges.length;i++) {
  	hm.put(i, new HashSet<Integer>());
  }
  
  for(int i=0;i<edges.length;i++) {
  if(dfs(new HashSet<Integer>(),hm,edges[i][0],edges[i][1])) {
  	return edges[i];
  }
  HashSet<Integer>p=hm.get(edges[i][0]);
  p.add(edges[i][1]);
  hm.put(edges[i][0],p);
  HashSet<Integer>p1=hm.get(edges[i][1]);
  p1.add(edges[i][0]);
  hm.put(edges[i][1],p1);
  
  }
  return null;
  
  }
  
  public static boolean dfs(HashSet<Integer>vis,HashMap<Integer,HashSet<Integer>>hm,int src,int tar){
  	if(src==tar) {
  		return true;
  	}
  
   
  vis.add(src);
  
  for(int next:hm.get(src)) {
  	if(!vis.contains(next)) { 
  		if(dfs(vis,hm,next,tar)) {return true;}
  	}
  }
  
  return false;
  
  }
  
  public int kthSmallest(int[][] matrix, int k) {
      
  	boolean visited[][]=new boolean[matrix.length][matrix[0].length];
  	
  		
  return 0;		
  	}
  	
  	
  static class triple implements Comparable<triple>{
  	int sum;
  	int a;
  	int b;
  	public triple(int sum,int a,int b) {
  		this.sum=sum;
  		this.b=b;
  		this.a=a;
  	}
  	
  	public int compareTo(triple o) {
  		
  		if(o.sum<this.sum) {
  			return -1;
  		}else if(o.sum>this.sum) {
  			return 1;
  		}
  		else {
  			
  			return o.a-this.a;
  		}
  		
  	}
  	
  }
  
  public static String minWindow(String s, String t) {
      s=s.toLowerCase();
      t=t.toLowerCase();
  	if(t.length()>s.length()){
          return "";
      }
      
      if(s.equals(t)){
          return t;
      }
      
      if(t.length()==0||s.length()==0){
          return "";
      }
      
      
      int i=0;
      int j=0;
      
      HashMap<Character,Integer>hm=new HashMap<>();
      HashMap<Character,Integer>hm1=new HashMap<>();
      int matchcount=0;
      for(int m=0;m<s.length();m++){
          
          hm.put(s.charAt(m),hm.getOrDefault(s.charAt(m),0)+1);
          hm1.put(s.charAt(m),hm1.getOrDefault(s.charAt(m),0)+1);
      
      }
      
      String ans="";
      int difference=Integer.MAX_VALUE;
      int arr[]=new int[27];
      while(i<s.length()){
        char ch=s.charAt(i);
        int indx=(int)(ch)-96;
          if(hm.containsKey(ch)) {
            int val=hm.get(ch);  
            System.out.println(indx);
          	if(arr[indx]<val) {
          		matchcount++;
          	}
        
  
          }
          
          
          
          while(matchcount==t.length()&&i>j) {
          
          	char ch1=s.charAt(j);
          	int ind=(int)(ch1)-96;
          	int val=hm.get(ch1);
          	 if(hm.containsKey(ch1)) {
          	 if(arr[ind]<=val) {
          		 matchcount--;
          	 
          	 }
          	int len=(i-j+1);
          	if(len<difference) {
          		ans=s.substring(j,i+1);
          difference=len;
          	}
          	arr[ind]--;
          	 }
          
          j++;
          }
          
       i++;}
      int len=(i-j+1);
  	if(len<difference) {
  		ans=s.substring(j,i+1);
  difference=len;
  	}
      System.out.println(ans);
  return ans;
  }
  
  public static void main(String[] args) throws IOException{
     Scanner s=new Scanner(System.in);
  
     int op=s.nextInt();
     
     while(op-- > 0) {
  
  	   String str=s.next();
  
  	   String t=s.next();
  	   boolean pres=false;
  	   for(int i=0;i<str.length();i++) {
  		   char ch=str.charAt(i);
  		   if(ch==t.charAt(0)) {
  			   pres=solve(str,i,t.length(),1,t);
  		   if(pres) {
  			   break;
  		   }
  		   }
  	   }
  	if(pres) {
  		System.out.println("YES");
  	}else {
  		System.out.println("NO");
  	}
  	
  	
     
     }
  	
  }
  
  
  
  public static boolean solve(String str,int indx,int len,int x,String t) {
  	
  	if(x==t.length()) {
  	    return true;
  	}
  	
  	if(x+1==t.length()) {
  	
  		if(indx+1<str.length()&&str.charAt(indx+1)==t.charAt(x)) {
  			
  			return true;
  		
  		}
  		
  			
  		else if(indx-1 >= 0&&str.charAt(indx-1)==t.charAt(x)) {
  		
  			return true;
  			
  		}
  		
  		else {
  		
  			return false;
  		
  		}
  	
  	}
  	
  	
  	boolean ans=false;
  	boolean ans2=false;
  	if(indx-1>=0&&str.charAt(indx-1)==t.charAt(x)) {
  		ans=left(str,t,len,x,indx-1);
  	}
  	
  	if(ans) {
  		return true;
  	}
  	if(indx+1<str.length()&&str.charAt(indx+1)==t.charAt(x)) {
  		ans2=solve(str,indx+1,len,x+1,t);
  	}
  	
  	
  	return ans||ans2;
  	
  }
  
  
  public static boolean left(String str,String t,int len,int x,int indx) {
  	
  	while(x<t.length()&&indx>=0) {
  	
  		if(str.charAt(indx)==t.charAt(x)) {
  			x++;
  			indx--;
  			
  		}else {
  			break;
  		}
  		
  		if(x==t.length()) {
  			return true;
  		}
  	}
  	return false;
  }
  
  
  
  
  public static String toBinary(int x) {
      return String.format("%32s", Integer.toBinaryString(x)).replaceAll(" ", "0");
  }
  
  public static int Substr(String s2, String s1){
      int counter = 0; //pointing s2
      int i = 0;
      for(;i<s1.length();i++){
          if(counter==s2.length())
              break;
          if(s2.charAt(counter)==s1.charAt(i)){
              counter++;
          }else{
              //Special case where character preceding the i'th character is duplicate
              if(counter>0){
                  i -= counter;
              }
              counter = 0;
          }
      }
      return counter < s2.length()?-1:i-counter;
  }
  
  public static void primeFactors(long n,HashMap<Long,Long>hm)
  {
  
      // Print the number of 2s that divide n
      while (n%2==0)
      {
        //  System.out.print(2 + " ");
      
      	
      	n /= 2;
  
      hm.put(2L,hm.getOrDefault(2L,0L)+1L);
      }
  
      // n must be odd at this point.  So we can
      // skip one element (Note i = i +2)
      for (long i = 3; i <= Math.sqrt(n); i+= 2)
      {
          // While i divides n, print i and divide n
          while (n%i == 0)
          {
              //System.out.print(i + " ");
              n /= i;
     //System.out.println(i);
          hm.put(i,hm.getOrDefault(i,0L)+1L);
          
          }
      }
  
      // This condition is to handle the case whien
      // n is a prime number greater than 2
      if (n > 2)
         // System.out.print(n);
  hm.put(n,1L);
  }
  
  	
  	
   
  
  public static long fact1(long d,long stop) {
  	
  	long ans=1;
  	for(long i=d;i>stop;i--) {
  		ans*=i;
  		
  	}
  	return ans;
  }
  public static long fact(long d) {
  	long ans=1;
  	for(long i=2;i<=d;i++) {
  		ans*=i;
  	}
  	return ans;
  }
  
  
  public static int mod(long x){
     long M=1000000007;
      
  	
  	return (int)((x%M+M)%M);
  }
  
  static int add(long a,long b){
      return mod(mod(a)+mod(b));
  }
  
  
  public static  int mul(int a,int b){
      return mod(mod(a)*mod(b));
  }
  
  static void printAllKLengthRec(char[] set,
          String prefix,
          int n, int k,ArrayList<String>l)
  {
  
  // Base case: k is 0,
  // print prefix
  if (k == 0)
  {
  //System.out.println(prefix);
  l.add(prefix);
  	return;
  }
  
  // One by one add all characters
  // from set and recursively
  // call for k equals to k-1
  for (int i = 0; i < n; ++i)
  {
  
  // Next character of input added
  String newPrefix = prefix + set[i];
  
  // k is decreased, because
  // we have added a new character
  printAllKLengthRec(set, newPrefix,
           n, k - 1,l);
  }
  }
  
  
  
  
  	 
  	 
  	 
  //	class Pair implements Comparable<Pair>
  //	{
  //	   int x,y;
  //	    public Pair(int x,int y)
  //	    {
  //	        this.x = x;
  //	        this.y = y;
  //	    }
  //	    public int compareTo(Pair o)
  //	    {
  //	        return this.y-o.y;
  //	    }
  //	}
  	
  	}
  
  