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.File;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.Vector;

public class recycledNumbers{
	public static void main(String args[]){
		try{
			PrintWriter out = new PrintWriter(new FileWriter("output.txt")); 
			Scanner sc = new Scanner(new File(args[0]));
			Integer min, max, d, n, recy;
			Vector<Integer> v;
			Vector<Integer> recV;

			int t = sc.nextInt();
			
			for(int i=1;i<=t;i++){
				n=0;
				min = sc.nextInt();
				max = sc.nextInt();
				d = min.toString().length();
				v = new Vector<Integer>();
				for(int j=min;j<=max;j++){
					recV = new Vector<Integer>();
					for(int k=1;k<d;k++){
						recy = (int) ((j%Math.pow(10,k))*(Math.pow(10,d-k)) + j/Math.pow(10,k));
						if(recy<=max && recy >=min && recy!=j && !recV.contains(recy)){
							if(!v.contains(recy)){
								n++;
								recV.add(recy);
								v.add(j);
								}
						}
					}
				}
				out.println("Case #"+i+": "+n);
			}
			

			out.close();
		}catch (Exception e){
        }
	}
}