import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;

/**
 * @author mondodello
 */
public class GCJ_2012Q_RecycledNumbers {
    private static boolean isAValidRotation(String s1, String s2) {
        return (s1.length() == s2.length()) && ((s1 + s1).contains(s2));
    }

    public static void main(String[] args) throws IOException {

        String inputFile = "in.txt";
        String outputFile = "out.txt";

        BufferedReader br = new BufferedReader(new FileReader(inputFile));
        PrintWriter pw = new PrintWriter(new FileWriter(outputFile));

        int numOfTestCases = Integer.parseInt(br.readLine());

        for (int t = 0; t < numOfTestCases; t++) {
            String[] split = br.readLine().split(" ");

            int A = Integer.parseInt(split[0]);
            int B = Integer.parseInt(split[1]);

            int count = 0;
            
            // shamelessly brute-forcing this ;)
            for (int i = A; i <= B; i++) {
                for (int j = A; (i != j) && (j <= B); j++) {
                    if (isAValidRotation(Integer.toString(i), Integer.toString(j))) {
                        count++;
                    }
                }
            }

            System.out.println("Case #" + (t + 1) + ": " + count);
            pw.println("Case #" + (t + 1) + ": " + count);
        }

        pw.close();
        br.close();
    }
}