import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;

public class Recycled {
    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            int t = Integer.parseInt(br.readLine());
            for (int i = 0; i < t; i++) {
                String[] str = br.readLine().split(" ");
                int a = Integer.parseInt(str[0]);
                int b = Integer.parseInt(str[1]);
                System.out.println("Case #" + (i + 1) + ": " + find(a, b));
            }
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    private static int find(int a, int b) {
        HashSet<Long> used = new HashSet<Long>();
        int digits = String.valueOf(a).length();
        if (digits == 1) return 0;
        for (int i = a; i <= b; i++) {
            int s = 10;
            int m = (int) Math.pow(10, digits-1);
            for (int j = 0; j < digits-1; j++) {
                int r = i % s;
                if (r < s/10) continue;
                int q = i / s;
                int rn = r * m + q;
                s *= 10; m /= 10;
                if (i != rn && rn >= a && rn <= b) {
                    long pp;
                    if (rn < i) pp = (long)rn << 30 | i;
                    else pp = (long)i << 30 | rn;
                    if (!used.contains(pp)) {
                        used.add(pp);
                    }
                }
            }
        }
        return used.size();
    }
}

import java.io.BufferedInputStream;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.HashMap;

public class RecycledNumbers{
	
	

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		try {
		
		File inf = new File("/home/jeyram/Downloads/"+"C-large.in");
		File of = new File("/home/jeyram/Downloads/"+"rl-rn-large-output.in");
		FileInputStream in = new FileInputStream(inf);
		FileOutputStream out = new FileOutputStream(of);
		// Get the object of DataInputStream
		  //DataInputStream in = new DataInputStream(fstream);
		  BufferedReader br = new BufferedReader(new InputStreamReader(in));
		  String strLine;
		  //Read File Line By Line
		  if ((strLine = br.readLine()) != null)   {
			  System.out.println (strLine);
			  int itrs= Integer.parseInt(strLine);
			  int count=0;
			  //#test cases
			  while (count < itrs)   {
				  if ((strLine = br.readLine()) != null){
					  //	input str
					  String[] inst = strLine.split(" ");
					  //start no
					  final int A = Integer.parseInt(inst[0]);
					  //end no
					  final int B = Integer.parseInt(inst[1]);	  
					  //no of numbers
					  int y=0;
					  //no of iterations check 3 for 4 digit number
					  int exp = (String.valueOf(A)).length()-1;
					  int exC=1;
					  while (exC<=exp){
						  int n =A;						  
						  while(n<=B){
							  int pow =1;
							  for(int p1=1;p1<exC;p1++)
							  {pow*=10;}
							  int q = n / (10*pow);
							  int r = n % (10*pow);
							  if(r!=0 && q!=0){
								  String ne = String.valueOf(r)+String.valueOf(q);
								  int m = Integer.parseInt(ne);
								  if((m<=B) && (n!=m) && (m>n) && 
										  (String.valueOf(n)).length()==(String.valueOf(m)).length()){//valid pair
									  //System.out.println(":"+n +":"+m);									  
									  y++;
									  }
							  }
							  n++;
						  }
						  exC++;
					  }
							  
					  

					  //System.out.println("output string"+y);
					  //write as Case #1: 2 3
					  BufferedWriter bw  = new BufferedWriter(new OutputStreamWriter(out));
					  bw.write("Case #"+(count+1)+": "+y);
					  bw.newLine();
					  bw.flush();
					  }
				  count++;
			  }
		  
		  }
		  //Close the input stream
		  in.close();
		  out.close();
		}catch (Exception e)
		{
			e.printStackTrace();
		}
		finally{
			
		}
	}
}