import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;


public class GoogleC {
	public String szamol(String input){
		String result="";
		String a=input;
		Integer min=Integer.parseInt(a.substring(0,a.indexOf(' ')));
		a=a.substring(a.indexOf(' ')+1);
		Integer max=Integer.parseInt(a);
		Long count=0l;
		for(Integer i=min; i<=max; i++){
			String e1=i.toString();
			Set<Integer> db=new HashSet<Integer>(); 
			for (int j=1; j<e1.length();j++){
				
				String e2=e1.substring(j)+e1.substring(0,j);
				Integer k=Integer.parseInt(e2);
				if (k>i && k<=max){
					db.add(k);
					//System.out.println(e1+"\t"+e2);
				}
				
			}
			count+=db.size();
		}
		
		return count.toString();
	}
	public static void main(String[] args) {
		GoogleC a=new GoogleC();
		//String filename="input.txt";
		//String filename="C-small-attempt0.in";
		String filename="C-large.in";
		String thisLine;
		try {
			BufferedReader br = new BufferedReader(new FileReader(filename));
			BufferedWriter bw= new BufferedWriter(new FileWriter(filename+".out"));
			thisLine=br.readLine();
			Integer tnum=Integer.parseInt(thisLine);
		     for(int i=0;i<tnum;i++) { // while loop begins here
		    	 	thisLine=br.readLine();
		           System.out.println(thisLine);
		           System.out.println("Case #"+(i+1)+": "+a.szamol(thisLine)+"\n");
		           bw.write("Case #"+(i+1)+": "+a.szamol(thisLine)+"\n");
		         } // end while 
		        // end try
		     br.close();
		     bw.close();
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}


	}

}


import java.util.*;


public class C
{
   public static void main(String[] args)
   {
      new C(new Scanner(System.in));
   }

   ArrayList<Integer> makeNice(int v)
   {
      ArrayList<Integer> vs = new ArrayList<Integer>();
      while (v > 0)
      {
         vs.add(v%10);
         v = v/10;
      }
      return vs;
   }

   int changeBack(ArrayList<Integer> val)
   {
      int res = 0;
      int u=1;
      for (int v : val)
      {
         res += v*u;
         u = u*10;
      }
      return res;
   }

   public C(Scanner in)
   {
      int tc = 1;
      int T = in.nextInt();
      while (T-->0)
      {
         int A = in.nextInt();
         int B = in.nextInt();
         int res = 0;
         for (int val=A; val<=B; val++)
         {
            TreeSet<Integer> ts = new TreeSet<Integer>();
            //System.out.println(val);
	//System.out.print(val+":");
	    ArrayList<Integer> vs = makeNice(val);
            for (int u=0; u<vs.size(); u++)
            {
               //System.out.println(vs);
	       if (vs.get(vs.size()-1) != 0)
               {
                  int nv = changeBack(vs);
                  if (nv > val && nv <= B)
                     ts.add(nv);
               }
               Collections.rotate(vs,1);
            }
	    //System.out.println(ts);
            res += ts.size();
	//	System.out.println(ts);
         }
         System.out.printf("Case #%d: %d%n", tc++, res);
      }
   }
}
