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();
    }
}

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class Cbits {
	public static void main(String[] args) throws FileNotFoundException {
		Scanner scan = new Scanner(new File("C-large.in"));
		System.setOut(new PrintStream("C-large.out"));

		int t = scan.nextInt();
		for (int c = 0; c < t; c++) {
			int a = scan.nextInt();
			int b = scan.nextInt();
			int ans = 0;
			int bDigits = digits(b);

			for (int n = a; n < b; n++) {
				int nDigits = digits(n);
				int nDigitCount = numDigits(n);
				Set<Integer> done = new HashSet<Integer>();
				for (int i = 1; i < nDigitCount; i++) {
					int mDigits = rotate(nDigits, nDigitCount, i);
					if (nDigits < mDigits && mDigits <= bDigits
					        && !done.contains(mDigits)) {
						ans++;
						done.add(mDigits);
					}
				}
			}

			System.out.printf("Case #%d: %d%n", c + 1, ans);
		}
	}

	private static int numDigits(int n) {
		int num = 0;
		int temp = n;
		while (temp > 0) {
			num++;
			temp /= 10;
		}
		return num;
	}

	private static int digits(int n) {
		int num = numDigits(n);

		int digits = 0;
		int temp = n;
		for (int i = 0; i < num; i++) {
			digits |= (temp % 10) << i * 4;
			temp /= 10;
		}
		return digits;
	}

	private static int rotate(int nDigits, int digitCount, int r) {
		int rotPartMask = (1 << r * 4) - 1;
		int rotPart = nDigits & rotPartMask;

		int ans = nDigits;
		ans >>>= r * 4;
		ans |= rotPart << (digitCount - r) * 4;

		return ans;
	}

	private static int normal(int n, int digitCount) {
		int base = 1;
		int ans = 0;
		for (int i = 0; i < digitCount; i++) {
			int mask = 0b1111 << i * 4;
			int digit = (n & mask) >>> i * 4;
			ans += digit * base;
			base *= 10;
		}
		return ans;
	}
}