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

package codejam;

import java.util.*;

public class RecycledNumbers {

	public static void main(String[] args) {

		Scanner in = new Scanner(System.in);
		
		int T = in.nextInt();
		
		for (int k = 1; k <= T; k++) {
			
			int c = 0;
			
			int A = in.nextInt();
			int B = in.nextInt();
			
			for (int cand = A; cand <= B; cand++) {
				String str = Integer.toString(cand);
				char[] cstr = str.toCharArray();
				int n = cstr.length;
				int first = cstr[0]-0x30;
				int mod = (int)Math.pow(10, n-1);
				Set<String> ms = new HashSet<String>();
				for (int i = 1; i < n; i++) {
					int d = cstr[i]-0x30;
					if (d == 0) continue;
					if (d >= first) {
							String teststr = str.substring(i) + str.substring(0, i);
							if (ms.contains(teststr)) {
								continue;
							}
							ms.add(teststr);
							int test = Integer.parseInt(teststr);
							if (test <= B && test > cand) {
								//System.out.println(str + ", " + teststr + ", " + A + ", " + B);
								c++;
							}
					}
				}
			}
			
			System.out.println("Case #" + k + ": " + c);
			
		}
		
	}

}
