package codejam;

import java.util.*;
import java.io.*;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

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

public class C {
    static final int MAX_N = 2000000;
    static int[][] precalc;
    static {
        precalc = new int[MAX_N + 1][];
        List<Integer> values = new ArrayList<Integer>();
        for (int i = 1, deg = 1; i <= MAX_N; ++i) {
            if (i == deg * 10) {
                deg *= 10;
            }
            values.clear();
            int curr = (i % 10) * deg + (i / 10);
            while (curr != i) {
                if (curr > i) {
                    values.add(curr);
                }
                curr = (curr % 10) * deg + (curr / 10);
            }
            int[] z = new int[values.size()];
            for (int j = 0; j < z.length; ++j) {
                z[j] = values.get(j);
            }
            precalc[i] = z;
        }
    }

    public void run(Scanner in, PrintWriter out, int nCase) {
        int min = in.nextInt();
        int max = in.nextInt();
        int count = 0;
        for (int i = min; i <= max; ++i) {
            for (int j : precalc[i]) {
                if (j <= max) {
                    ++count;
                }
            }
        }
        out.printf("Case #%d: %d%n", nCase, count);
    }

    public static void main(String[] args) throws FileNotFoundException {
        String filename = C.class.getSimpleName().toLowerCase();

        Scanner in = new Scanner(new File(filename + ".in"));
        PrintWriter out = new PrintWriter(filename + ".out");

        int nCases = in.nextInt();

        for (int i = 1; i <= nCases; ++i) {
            new C().run(in, out, i);
        }

        out.close();
        in.close();
    }
}
