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

public class template {
	public static void main(String[] args) throws IOException {		
		StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
		PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
		//PrintWriter out = new PrintWriter("output.txt");
		
	
		
		in.nextToken(); int count = (int)in.nval;
		
		for(int c = 1 ; c <= count ; c++) {
			int rotations = 0;
			
			in.nextToken(); int a = (int)in.nval;
			in.nextToken(); int b = (int)in.nval;
			
			/*
			ignore 0
			1 = 0 to 9 
			2 = 10 to 99
			...
			7 = 1 000 000 to 9 999 999
			 */
			int[] min = {0, 0, 10, 100, 1000, 10000, 100000, 1000000};
			int[] max = {0, 9, 99, 999, 9999, 99999, 999999, 9999999};
			// set limits
			for(int i = 1 ; i <= 7 ; i++) {
				min[i] = Math.max(min[i], a);
				max[i] = Math.min(max[i], b);
			}
			
			for(int len = 2 ; len <= 7 ; len++) {
				int exp = (int) Math.pow(10, len-1);
				for(int i = min[len] ; i <= max[len] ; i++) {
					int r = i;
					for(int j = 0 ; j < len-1 ; j++) {
						r = r % exp * 10 + (r/exp);
						if (r == i) break;
						if (r > i && r <= max[len] && i != r) rotations++;
					}
				}
			}
			out.println("Case #" + c + ": " + rotations);
		}
		
		
		out.flush();
		out.close();
	}
}
