import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;

public class Recycled {
    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            int t = Integer.parseInt(br.readLine());
            for (int i = 0; i < t; i++) {
                String[] str = br.readLine().split(" ");
                int a = Integer.parseInt(str[0]);
                int b = Integer.parseInt(str[1]);
                System.out.println("Case #" + (i + 1) + ": " + find(a, b));
            }
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    private static int find(int a, int b) {
        HashSet<Long> used = new HashSet<Long>();
        int digits = String.valueOf(a).length();
        if (digits == 1) return 0;
        for (int i = a; i <= b; i++) {
            int s = 10;
            int m = (int) Math.pow(10, digits-1);
            for (int j = 0; j < digits-1; j++) {
                int r = i % s;
                if (r < s/10) continue;
                int q = i / s;
                int rn = r * m + q;
                s *= 10; m /= 10;
                if (i != rn && rn >= a && rn <= b) {
                    long pp;
                    if (rn < i) pp = (long)rn << 30 | i;
                    else pp = (long)i << 30 | rn;
                    if (!used.contains(pp)) {
                        used.add(pp);
                    }
                }
            }
        }
        return used.size();
    }
}

package CodeJam2012;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.StringTokenizer;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		FileReader in = new FileReader("C-large.in");
		BufferedReader buff = new BufferedReader(in);
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter(
				"C-large.out")));

		int nCases = Integer.parseInt(buff.readLine());
		StringBuilder output = new StringBuilder("");

		for (int i = 0; i < nCases; i++) {
			String input = buff.readLine();
			output.append("Case #" + (i + 1) + ": " + getPairs(input) + "\n");
		}
		out.print(output.toString());
		in.close();
		out.close();
	}

	private static long getPairs(String input) {
		StringTokenizer st = new StringTokenizer(input);
		String first = st.nextToken();
		String second = st.nextToken();
		int from = Integer.parseInt(first);
		int to = Integer.parseInt(second);
		long counter = 0;

		HashSet<String> set = new HashSet<String>();
		for (int i = from; i <= to; i++) {
			String temp = i + "";
			for (int j = 0; j < temp.length(); j++) {
				String next = temp.substring(j, temp.length())
						+ temp.substring(0, j);
				int x = Integer.parseInt(next);
				if (x <= to && x >= from && i < x
						&& !set.contains(temp + "$" + next)) {
					counter++;
					set.add(temp + "$" + next);
				}
			}
		}
		return counter;
	}
}
