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.*;

public class Main{
	static int power(int d)
	{
		if(d== 0) return 1;
		else if(d%2 == 0) 
		{
			int a = power(d/2);
			return a*a;
		}
		else
		{
			int a = power(d/2);
			return a*a*10;
		}
	}
	public static void main(String [] args)
	{
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for(int cc = 1; cc<= T; cc++)
		{
			int A = in.nextInt();
			int B = in.nextInt();
			int Digit = Integer.toString(A).length();
			int tab[] = new int[3000];
			for(int i = 0; i<3000; i++)
			{
				tab[i] = -1;
			}
			for(int i = A; i<B; i++)
			{
				if(tab[i] == -1)
				{
					tab[i] = 1;
					int current = i;
					for(int j = 0; j<Digit-1; j++)
					{
						int a = current%10;
						int b = current/10;
						int next = a*power(Digit-1)+b;
						//System.out.println(next);
						if(next >= A && next <=B)
						{
							if(tab[next] == -1)
							{
								tab[next] =0;
								tab[i] ++;
							}
						}
						current = next;
					}
				}
			}
			int res = 0;
			for(int i = A; i<B; i++)
			{
				res += tab[i]*(tab[i]-1)/2;
			}
			System.out.println("Case #"+cc+": "+res);
		}
	}
}