import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

class RecycledNumbers{
	
	
	
	int getcount(int small,int large){
		int count = 0;
		for(int currnum = small; currnum < large; currnum++){
			int permut = currnum;
			int no_of_digits = 0;
			while(permut > 0){
				permut = permut/10;
				no_of_digits++;
			}
			int lastDigit = currnum % 10;
			permut = currnum / 10;
			permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
			while(permut != currnum){
				
				if(permut >= currnum && permut <= large){
					
					count++;
				}
				lastDigit = permut % 10;
				permut = permut / 10;
				permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
				
			}
			
		}
		
		return count;
	}
	
	public static void main(String args[]){
		RecycledNumbers d = new RecycledNumbers();
		
		int no_of_cases = 0;
		String input = "";
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		try{
			no_of_cases = Integer.parseInt(br.readLine());
		}
		catch(Exception e){
			System.out.println("First line is not a number");
		}
		
		for(int i=1; i <= no_of_cases;i++){
			try{
				input = br.readLine();
			}
			catch(Exception e){
				System.out.println("Number of test cases different from the number mentioned in first line");
			}
			
			System.out.print("Case #" +i+": ");
			
			StringTokenizer t =  new StringTokenizer(input);
			int small=0,large=0;
			if(t.hasMoreTokens()){
				small = Integer.parseInt(t.nextToken());
			}
			if(t.hasMoreTokens()){
				large = Integer.parseInt(t.nextToken());
			}
			System.out.println(d.getcount(small,large));
			
		}
		
		
		

	}
	
	
}
import java.util.Scanner;

class Recycle{
    static Scanner sc = new Scanner(System.in);
    static long[] pow={1,10,100,1000,10000,100000,1000000,10000000};
    public static void solve()
    {
	long A =sc.nextInt();
	long B =sc.nextInt();
	long sum=0;
	long j;
	String si,sj,sk;
	int tj,k;
	Boolean t2,t=false;
	int d,z='0';
	for(long i=A;i<=B;i++)
	    {if(i>9){
		    // t=(i%10==0);
		
	     	    // j=(i/10)+(i%10)*pow[(int)Math.round(Math.floor(Math.log(i)/Math.log(10)))];
		    si=""+i;
		    // tj=(int)(j%10);
		    // d=z+tj;
		    sj=si;
		    sk="";
		    sk=sk+sj.charAt(sj.length()-1);
		    for(k=1;k<sj.length();k++)
			sk=sk+sj.charAt(k-1);
		    // t2=t;
		    j=Integer.parseInt(sk);
		    
	     	    //System.out.println(i+" "+j);
		    while(!sk.equals(si))
			{
			    if(j>i && j<=B && j>=A && sk.charAt(0)!=0 && si.charAt(0)!=0)
				sum++;
			    sj=sk;
			    sk="";
			    sk=sk+sj.charAt(sj.length()-1);
			    for(k=1;k<sj.length();k++)
				sk=sk+sj.charAt(k-1);
			    j=Integer.parseInt(sk);
			    //System.out.println(i+" "+si+" "+j+" "+sk);
			    // if(!t2)
			    // 	j=(j/10)+(j%10)*pow[(int)Math.round(Math.floor(Math.log(j)/Math.log(10)))];	
			    // else
			    // 	j=(j/10)+(j%10)*pow[1+(int)Math.round(Math.floor(Math.log(j)/Math.log(10)))];
			    // t2=t;
			}
	     	}

	    }
	
	System.out.println(sum);
    }

    public static void main(String[] args)
    {
	int n=sc.nextInt();
	sc.nextLine();

	for(int i=0;i<n;i++)
	    {
		System.out.print("Case #"+(i+1)+": ");
		solve();
	    }
    }
    
}