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.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.Scanner;


public class Recycle
{

		static int u,l,j,n,m=0,k;
		static int arr[];
	
	public static void solve() throws Exception
	{
		PrintWriter out =new PrintWriter(new File("Recycle.out"));
		Scanner sc =new Scanner(new File("R.in"));
		int t=sc.nextInt();
			
		for (int i = 1; i <= t; i++)
		{		int p;
				arr=new int[1000];
				
				l=sc.nextInt();
				u=sc.nextInt();
				int res=0,r=0;
				for(j=l;j<=u;j++)	
					{		
					
					String j1=Integer.toString(j);
				//out.println("j "+j1);
				for(int x=((j1.length())-1);x>=1;x--)
					{
					for(p=0;p<1000;p++){
					String c=j1.substring(x,(j1.length()));
					//out.println("c "+c);
					String a=c+(j1.substring(0,x));
					//out.println("a "+a);
					int n=Integer.parseInt(a);
						
					
					for(k=l;k<=u;k++)
					{
					if((k!=j) && (k==n) && (n!=arr[p]))
						{
				
						
				
				res=res+1;
							arr[p]=n;
						break;
						}	
					
					}
				}	
				
			
			}}
			out.println("Case #"+ i +": "+(res/2000));
		}
			
		out.close();
	}
	
	public static void main(String[] args) throws Exception
	{
		solve();
	}
	
}

