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 q3 {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		
		String input = in.readLine();
		int numCases = Integer.valueOf(input);
		
		for (int caseCount = 1; caseCount <= numCases; caseCount++) {
			input = in.readLine();
			String A_string = input.split(" ")[0];
			String B_string = input.split(" ")[1];
			int A = Integer.valueOf(A_string);
			int B = Integer.valueOf(B_string);
			int n_int;
			int m_int;
			int recycledPairCount = 0;
			for (n_int = A; n_int < B; n_int++) {
				for (m_int = n_int + 1; m_int <= B; m_int++) {
					String n = Integer.toString(n_int);
					String m = Integer.toString(m_int);
					boolean found = false;
					for (int i = (n.length() - 1); i > 0 && found == false; i--) {
						String sub = n.substring(i);
						char[] array = n.toCharArray();
						String shortened = new String(array, 0, i);
						sub = sub.concat(shortened);
			
						if (sub.equals(m)) {
							found = true;
							recycledPairCount++;
						}
					}
				}
			}
			System.out.println("Case #" + caseCount + ": " + recycledPairCount);
		}
	}

}
