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 googlejam;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class ProblemCLinear {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int numberOfCases = sc.nextInt();
		sc.nextLine();
		for (int i = 0; i < numberOfCases; i++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			int sum = 0;
			Map<Integer, Set<Integer>> found = new HashMap<Integer, Set<Integer>>();
			for (int n = A; n <= B; n++) {
				List<Integer> rotations = getRotations(n);
				for (int j : rotations) {
					if ((n != j) && isInRange(j, A, B)) {

						int min = Math.min(n, j);
						int max = Math.max(n, j);
						Set<Integer> foundForInt = found.get(min);
						if (foundForInt == null) {
							Set<Integer> set = new HashSet<Integer>();
							set.add(max);
							found.put(min, set);
							sum++;
						} else if (!foundForInt.contains(max)) {
							foundForInt.add(max);
							sum++;
						}

					}
				}
			}
			System.out.println(String.format("Case #%d: %d", i + 1, sum));
		}
	}

	private static boolean isInRange(int j, int a, int b) {
		return a <= j && j <= b;
	}

	private static List<Integer> getRotations(int n) {
		String nString = Integer.toString(n);
		String doubleNString = nString + nString;
		List<Integer> rotations = new ArrayList<Integer>();
		for (int i = 1; i < nString.length(); i++) {
			Integer valueOf = Integer.valueOf(doubleNString.substring(i, i + nString.length()));
			rotations.add(valueOf);
		}
		return rotations;
	}

}
