import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}


import java.io.*;

public class Main {

    static final String FILE = "C-small-attempt0";
    static final String INPUT = FILE + ".in";
    static final String OUTPUT = FILE + ".out";
    //

    public static void main(String[] args) throws FileNotFoundException, IOException {
        int T, A, B, x, y;

        PrintWriter pw;
        try (BufferedReader br = new BufferedReader(new FileReader(INPUT))) {
            pw = new PrintWriter(OUTPUT);

            T = Integer.parseInt(br.readLine());
            for (x = 1; x <= T; x++) {
                y = 0;

                //
                String[] temp = br.readLine().split(" ");
                A = Integer.parseInt(temp[0]);
                B = Integer.parseInt(temp[1]);

                //
                for (int i = A; i <= B; i++) {
                    String n = Integer.toString(i);
                    String m = new String(n);
                    for (int j = 0; j < n.length() - 1; j++) {
                        m = m.charAt(m.length() - 1) + m;
                        m = m.substring(0, n.length());

                        if (Integer.parseInt(n) < Integer.parseInt(m) && Integer.parseInt(m) <= B) {
                            y++;
                        }
                    }
                }

                //
                System.out.println("Case #" + x + ": " + y);
                pw.println("Case #" + x + ": " + y);
            }
        }
        pw.close();
    }
}
