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.FileInputStream;
import java.io.FileNotFoundException;
import java.util.Scanner;


public class Main {

	/**
	 * @param args
	 */
	private static boolean [] used;
	public static int cnt(int a)
	{
		int res = 0;
		while(a != 0)
		{
			a/=10;
			res++;
		}
		return res;
	}
	
	public static int tenMult(int n)
	{
		int res = 1;
		for(int i = 0; i < n -1; i++)
			res *= 10;
		return res;
	}
 
	public static int solve(int n, int limit)
	{
		int res = 0;
		int c = cnt(n);
		int tmp = n;
		used = new boolean[2000000];
		for(int i = 0; i < c-1; i++)
		{
			int rem = tmp%10;
			tmp /= 10;
			
			tmp += tenMult(c) * rem;
			if(tmp <= 2000000 && tmp > n && tmp <= limit && used[tmp] == false)
				{
				used[tmp] = true;
				//System.out.println("for " + n + " = " + tmp);
				res++;}
		}
		return res;
	}
	
	public static void main(String[] args) throws FileNotFoundException {
		// TODO Auto-generated method stub
		System.setIn(new FileInputStream("input"));
		
		Scanner s = new Scanner(System.in);
		int n = s.nextInt();
		//used = new boolean[2000000];
		for(int j = 1; j <= n; j++)
		{
			
			int A = s.nextInt();
			int B = s.nextInt();
			int res = 0;
			for(int i = A; i <= B; i++)
			{
				res += solve(i,B);
			}
			System.out.println("Case #" + j + ": " + res);
		}
	}

}
