package qual;

import java.util.Scanner;

public class RecycledNumbers {

	public static void main(String[] args) {
		new RecycledNumbers().run();

	}

	private void run() {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int t = 0; t < T; t++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			int result = solve(A, B);
			System.out.printf("Case #%d: %d\n", t + 1, result);
		}
	}

	public int solve(int A, int B) {
		int result = 0;
		for (int i = A; i <= B; i++) {
			int dig = (int) Math.log10(A/*same as B*/) + 1;
			int aa = i;
			for (int d = 0; d < dig - 1; d++) {
				aa = (aa % 10) * (int)Math.pow(10, dig - 1) + (aa / 10);
				if (i == aa) {
					break;
				}
				if (i < aa && aa <= B) {
//					System.out.printf("(%d, %d) ", i, aa);
					result++;
				}
			}
		}
		return result;
	}

}

import java.io.*;

public class TaskC {
	public static void main(String[] args) {
		try {
			BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
			int t = Integer.valueOf(input.readLine());
			for(int z=1; z<=t; z++) {
				int out = 0;
				String[] line = input.readLine().split(" ");
				int A = Integer.valueOf(line[0]),
				    B = Integer.valueOf(line[1]);
				    
				for(int i=A; i<=B; i++)
					bylo[i] = false;
				    
				// czas na rotacje    
				ileRot = line[0].length() - 1;
				for(int i=A; i<=B; i++)
					if(bylo[i] == false) {
						bylo[i] = true;
						int dodajnik = 1;
						int liczba = i;
						String ls = Integer.toString(liczba);
						// System.out.println("Rotuje " + ls);
						// rotuje ile sie da
						for(int rot=0; rot<ileRot; rot++) {
							// wykonuje rotacje
							String tmp = ls.substring(1);
							tmp = tmp.concat(Character.toString(ls.charAt(0)));
							ls = tmp;
							liczba = Integer.valueOf(ls);
							// sprawdzam czy mam cos nowego
							if(bylo[liczba]==false && liczba>=A && liczba <= B) {
								// System.out.println("Zgadza sie z " + ls);
								bylo[liczba] = true;
								out += dodajnik;
								dodajnik += 1;
							}
						}
					}
				    
				System.out.println("Case #" + z + ": " + out);
			}
		} catch (Exception e) {
			System.err.println(e);
		}
	}
	
	
	static int ileRot;
	static boolean[] bylo = new boolean[2000001];
}
