import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

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


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

public class C {

    String PATH = "C:\\Users\\XiaoweiChen\\Desktop\\Jam\\";
    String inPath = PATH + "C-large.in";
    String outPath = PATH + "C-large.out";
    BufferedReader reader = null;
    BufferedWriter writer = null;
    StringTokenizer tokenizer = null;

    int ni() throws IOException {
        return Integer.parseInt(ns());
    }

    long nl() throws IOException {
        return Long.parseLong(ns());
    }

    double nd() throws IOException {
        return Double.parseDouble(ns());
    }

    String ns() throws IOException {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(reader.readLine());
        }
        return tokenizer.nextToken();
    }

    String nline() throws IOException {
        tokenizer = null;
        return reader.readLine();
    }

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

    public C() throws FileNotFoundException, IOException {
        reader = new BufferedReader(new FileReader(inPath));
        writer = new BufferedWriter(new FileWriter(outPath));
    }

    public void solve() throws IOException {
        int round = ni();
        for (int ccase = 1; ccase <= round; ccase++) {
            long A = nl();
            long B = nl();
            long count = 0;

            HashSet pair = new HashSet();

            for (long m = A; m <= B; m++) {
                String rep = Long.toString(m);
                int length = rep.length();
                for (int i = 1; i < length; i++) {
                    long n = Long.parseLong(rep.substring(length - i) + rep.substring(0, length - i));
                    if (n < m && n <= B && n >= A) {
                        if (!pair.contains(n + " < " + m)) {
                            pair.add(n + " < " + m);
                            count++;
                        }
                    }
                }
            }
            String print = "Case #" + ccase + ": " + count + "\n";
            System.out.print(print);
            writer.write(print, 0, print.length());
        }
        writer.close();
    }
}
