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.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class RN {

	static ArrayList<Character> str2list(String s) {
		ArrayList<Character> r = new ArrayList<Character>();
		for (char c : s.toCharArray()) {
			r.add(c);
		}
		return r;
	}

	static String list2str(ArrayList<Character> cs) {
		StringBuilder builder = new StringBuilder(cs.size());
		for (Character c : cs)
			builder.append(c);
		return builder.toString();
	}

	static ArrayList<String> cycles(String s) {
		ArrayList<Character> cs = str2list(s);

		ArrayList<String> res = new ArrayList<String>();

		for (int i = 0; i < cs.size(); i++) {
			Collections.rotate(cs, 1);
			res.add(list2str(cs));
		}
		
		HashSet<String> hs = new HashSet<String>(res);
		return new ArrayList<String>(hs);
	}

	static void log(String fs, Object... args) {
		System.err.println(String.format(fs, args));
	}

	public static void main(String[] args) throws FileNotFoundException {
		String filename = "src/C-small-attempt0.in";
		Scanner sc = 
				new Scanner(
						new FileInputStream(
								new File(filename)));
		PrintWriter pw = 
				new PrintWriter(
						new FileOutputStream(
								new File(filename + ".result")));

		int N = sc.nextInt();
		for (int task = 1; task <= N; task++) {
			int A = sc.nextInt();
			int B = sc.nextInt();

			int cnt = 0;
			for (int i = A; i <= B; i++) {
				String s = Integer.toString(i);
				for (String r : cycles(s)) {
					int n = Integer.parseInt(r);
					if (n >= A && n <= B && r.charAt(0) != '0' && !r.equals(s)) {
						cnt++;
					}
				}
			}
			pw.println(String.format("Case #%d: %d", task, cnt / 2));
		}
		pw.close();
	}

}
