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.*;
import java.util.*;

public class C {

	public static void main(String[] args) throws IOException {
               	//variable initialization
                String inFile = args[0];
		String outFile = inFile.split("\\.")[0] + ".out";

                //file reading...
                BufferedReader reader = new BufferedReader(new FileReader(inFile));
                PrintWriter writer = new PrintWriter(new FileWriter(outFile));

		//get input data
		int T = Integer.valueOf(reader.readLine());
		for (int t = 0; t < T; t++) {
			String[] str_nums = reader.readLine().split(" ");
			int A = Integer.valueOf(str_nums[0]);
			int B = Integer.valueOf(str_nums[1]);
			int count = 0;
			// for (int i = 1; i < 5; i++) {
			// 	for (int j = i+1; j < 5; j++) {
			// 		for (int k = 0; k < 10; k++) {
			// 			if (k == i || k == j) continue;
			// 			int shift = 1;
			// 			int n = i*100 + k*10 + j;
			// 			int m = n % (int)Math.pow(10, shift) * (int)Math.pow(10, 3 - shift)
			// 			      + n / (int)Math.pow(10, shift); 	
			// 			count++;
			// 			System.out.print(n + "->" + m + ", ");

			// 			shift = 2;
			// 			n = i*100 + j*10 + k;
			// 			m = n % (int)Math.pow(10, shift) * (int)Math.pow(10, 3 - shift)
			// 			      + n / (int)Math.pow(10, shift); 	
			// 			count++;
			// 			System.out.print(n + "->" + m + ", ");
			// 			
			// 		}
			// 		System.out.println();
			// 	}
			// }
			int digits = String.valueOf(A).length();
			for(int i = A; i < B; i++) {
				//Set<Character> chars = new HashSet<Character>();
				//for (char c : String.valueOf(i).toCharArray()) chars.add(c);
				//if (chars.size() != digits) continue;
				Set<Integer> olds = new HashSet<Integer>();
				for (int shift = 1; shift < digits; shift++) {
					int n = i;
					int m = n % (int)Math.pow(10, shift) * (int)Math.pow(10, digits - shift)
					      + n / (int)Math.pow(10, shift); 	
					if (m < A || m > B || n >= m) continue;
					if (olds.contains(m)) continue;
					olds.add(m);
					count++;
					// if (t == 3) System.out.print(n + "->" + m + ", ");
				}
			}
			String result = "Case #" + (t+1) + ": " + count;
			writer.println(result);
			System.out.println(result);
		}
		reader.close();
		writer.close();		
	}
}
