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.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Scanner;

public class MainClass {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(new File("C-large.in"));
		PrintWriter out = new PrintWriter(new File("RecycledNumbers.out"));

		int N = sc.nextInt();
		for (int i = 0; i < N; i++) {
			System.out.println("For case i: " + i);
			int A = sc.nextInt();
			int B = sc.nextInt();
			long count = 0;
			String s1 = "";
			for (int j = A; j <= B; j++) {
				s1 = "" + j;
				ArrayList<String> done = new ArrayList<String>();
				for (int k = 0; k < s1.length(); k++) {
					String tempS = s1;
					tempS = s1.substring(1) + s1.charAt(0);
					if (done.contains(tempS)) {
						continue;
					} else {
						s1 = tempS;
					}
					int temp = Integer.parseInt(s1);
					if ((temp < j) && (temp >= A) && (temp <= B)) {
						count++;
						done.add(s1);

					}

				}
			}
			out.println("Case #" + (i + 1) + ": " + count);
			System.out.println("**************");
		}
		out.close();

	}

}
