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;
	}

}


public class Case {
	
	//Atrib
	public int ind;
	public double a;
	public double b;

	public String resolver() {
		StringBuilder s_out = new StringBuilder("Case #" + ind + ": ");
		
		int cont = 0;
		
		for(int n = (int) a;n<b+1;n++)
			for(int m = n+1;m<=b;m++){
				
				String nn = String.valueOf(n);
				String mm = String.valueOf(m);
//				nn = nn.replace("0", "");
//				mm = mm.replace("0", "");
				if(nn.length() == mm.length() 
						&& Double.parseDouble(nn) < Double.parseDouble(mm)){
					
//					System.out.println("---" + nn + " " + mm);
					
					for(int i=1;i<nn.length();i++){
						
						String aux = nn.substring(i, nn.length()) + nn.substring(0, i);
						if(aux.equals(mm)){
//							System.out.println("---" + nn + " " + mm);
//							System.out.println( aux);
							cont++;
							i = nn.length();
						}
					}
					
				}
			}
		
//		System.out.println(cont);
		s_out.append(cont);
		
		s_out.append("\n");
		return s_out.toString();
	}

}//endClass
