import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

public class Recycled {
	public static void main(String[] args) throws Exception{
		String inputFile = "C-small-attempt0.in";
		
		BufferedReader input = new BufferedReader(new InputStreamReader(new FileInputStream(inputFile)));
		BufferedWriter output = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("output")));
		long num_cases = Long.parseLong(input.readLine());
		int current_case = 0;
		
		while (current_case < num_cases){
			current_case++;
			
			String[] fields = input.readLine().split(" ");
			int A = Integer.parseInt(fields[0]);
			int B = Integer.parseInt(fields[1]);
			int total = 0;
			
			for (int n = A; n < B; n++){
				for (int m = n+1; m <= B; m++){
					if (isRecycled(n,m)) total++;
				}
			}
			
			System.out.println("Case #" + current_case + ": " + total);
			output.write("Case #" + current_case + ": " + total + "\n");
		}
		output.close();
	}

	private static boolean isRecycled(int n, int m) {
		String sn = ""+n;
		String sm = ""+m;
		if (sn.length() != sm.length()) return false;
		int totaln = 0, totalm = 0;
		for (int i = 0; i < sn.length(); i++){
			totaln += sn.charAt(i);
			totalm += sm.charAt(i);
		}
		if (totaln != totalm) return false;
		for (int i = 0; i < sn.length()-1; i++){
			sm = sm.charAt(sm.length() - 1) + sm.substring(0, sm.length() - 1);
			if (sm.equals(sn)) return true;
		}
		return false;
	}
}


import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;

public class PC {

    private static int[] div = {10, 100, 1000, 10000, 100000, 1000000};

    public static void main(String[] args) throws FileNotFoundException {
        if (args.length != 1) {
            System.exit(1);
        }
        File inFile = new File(args[0]);
        Scanner sc = new Scanner(inFile);
        int T = sc.nextInt();
        try (PrintWriter out = new PrintWriter("out.txt")) {
            for (int i = 1; i <= T; i++) {
                int A = sc.nextInt(), B = sc.nextInt(), count = 0, maxPow = 0;
                for (int j = 0; j < 6; j++) {
                    if (A / div[j] == 0) {
                        maxPow = j - 1;
                        break;
                    }
                }
                int[] prevFound = new int[2000000];
                for (int j = A; j <= B; j++) {
                    int pow = 0;
                    while (true) {
                        int numFront = j / div[pow];
                        if (numFront == 0) {
                            break;
                        }
                        int numBack = j % div[pow];
                        int newNum = numBack * div[maxPow - pow] + numFront;
                        if (j < newNum && A <= newNum && newNum <= B && prevFound[newNum - 1] < j) {
                            prevFound[newNum - 1] = j;
                            count++;
                        }
                        pow++;
                    }
                }
                out.println("Case #" + i + ": " + count);
            }
        }
        System.out.println("Completed!");
    }
}