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

public class C {

    void solve() throws IOException {
        in("C-large.in"); out("C-large.out");

        long tm = System.currentTimeMillis();
        boolean[] mask = new boolean[2000000];
        int[] r = new int[10];
        int t = readInt();
        for (int cs = 1; cs <= t; ++cs) {
            int a = readInt();
            int b = readInt();
            int ans = 0;
            for (int m = a + 1; m <= b; ++m) {
                char[] d = String.valueOf(m).toCharArray();
                int c = 0;
                for (int i = 1; i < d.length; ++i) {
                    if (d[i] != '0' && d[i] <= d[0]) {
                        int n = 0;
                        for (int j = 0; j < d.length; ++j) {
                            int jj = i + j;
                            if (jj >= d.length) jj -= d.length;
                            n = n * 10 + (d[jj] - '0');
                        }
                        if (n >= a && n < m && !mask[n]) {
                            ++ans;
                            mask[n] = true;
                            r[c++] = n;
                        }
                    }
                }
                for (int i = 0; i < c; ++i) {
                    mask[r[i]] = false;
                }
            }
            println("Case #" + cs + ": " + ans);
            //System.out.println(cs);
        }
        System.out.println("time: " + (System.currentTimeMillis() - tm));
        exit();
    }

    void in(String name) throws IOException {
        if (name.equals("__std")) {
            in = new BufferedReader(new InputStreamReader(System.in));
        } else {
            in = new BufferedReader(new FileReader(name));
        }
    }

    void out(String name) throws IOException {
        if (name.equals("__std")) {
            out = new PrintWriter(System.out);
        } else {
            out = new PrintWriter(name);
        }
    }

    void exit() {
        out.close();
        System.exit(0);
    }

    int readInt() throws IOException {
        return Integer.parseInt(readToken());
    }

    long readLong() throws IOException {
        return Long.parseLong(readToken());
    }

    double readDouble() throws IOException {
        return Double.parseDouble(readToken());
    }

    String readLine() throws IOException {
        st = null;
        return in.readLine();
    }

    String readToken() throws IOException {
        while (st == null || !st.hasMoreTokens()) {
            st = new StringTokenizer(in.readLine());
        }
        return st.nextToken();
    }

    boolean eof() throws IOException {
        return !in.ready();
    }

    void print(String format, Object ... args) {
        out.println(new Formatter(Locale.US).format(format, args));
    }

    void println(String format, Object ... args) {
        out.println(new Formatter(Locale.US).format(format, args));
    }

    void print(Object value) {
        out.print(value);
    }

    void println(Object value) {
        out.println(value);
    }

    void println() {
        out.println();
    }

    StringTokenizer st;

    BufferedReader in;
    PrintWriter out;

    public static void main(String[] args) throws IOException {
        new C().solve();
    }
}

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