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.io.*;
   import java.util.*;

   public class rec {
      public static void main (String [] args) throws Exception {
         BufferedReader f = new BufferedReader(new FileReader("rec.in"));
         PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("rec.out")));
         int N = Integer.parseInt(f.readLine());
         for(int ie = 0; ie<N; ie++){
            s.clear();
            StringTokenizer st = new StringTokenizer(f.readLine());
            int a = Integer.parseInt(st.nextToken());
            int b = Integer.parseInt(st.nextToken());
            int count = 0;
            for(int i = a; i<=b; i++)
               cont(i, a, b);
             //   for(int j = i+1; j<=b; j++)
         //          if(o(""+i, ""+j)){
         //             if(!s.containsKey(""+i))
         //                s.put(""+i, new TreeSet<String>());
         //             s.get(""+i).add(""+j);
         //          }
            for(String e:s.keySet())
               count+=s.get(e).size();
            out.println("Case #"+(ie+1)+": "+count);
         }
         out.close();
         System.exit(0);
      }
      static Map<String, TreeSet<String>> s = new TreeMap<String, TreeSet<String>>();
      static int cont(int w, int a, int b){
         int c = 0;
         String e = w+"";
         if(e.charAt(0) == '0')
            return 0;
         for(int i = 1; i<e.length(); i++){
            String t = e.substring(i)+e.substring(0, i);
            if(t.charAt(0) == '0')
               continue;
            int q = Integer.parseInt(t);
            if(q>=a && q<= b && q<w){
               c++;
               if(!s.containsKey(""+q))
                  s.put(""+q, new TreeSet<String>());
               s.get(""+q).add(""+w);
            }
         }
         return c;
      }
      static boolean o(String a, String b){
         int pos = 0;
         while(pos<a.length())
         {
            int ind = b.indexOf(a.charAt(0), pos);
            if(ind == -1)
               return false;
            int e = b.length()-ind;
            pos = ind+1;
            boolean r = a.charAt(0) != '0' && b.charAt(0) != '0' &&a.substring(0, e).equals(b.substring(ind)) && a.substring(e).equals(b.substring(0, ind));
            if(r)
               return true;
         }
         return false;
      }
   }