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.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.HashSet;


public class C {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		BufferedReader reader = new BufferedReader(new FileReader("c.txt"));
		String line = reader.readLine();
		int count = 1;
		while ((line = reader.readLine()) != null) {
			String [] split = line.split("\\s+");
			int A = Integer.parseInt(split[0]);
			int B = Integer.parseInt(split[1]);
			int ans = 0;
			for (int i = A; i <= B; i++) {
				String num = i+"";
				String tmp = num;
				HashSet<String> set = new HashSet<String> ();
				for (int j = 1; j < num.length(); j++) {
					char t = tmp.charAt(0);
					tmp = tmp.substring(1);
					tmp = tmp + t;
					if((Integer.parseInt(tmp)+"").length() == num.length() && Integer.parseInt(num) < Integer.parseInt(tmp) && Integer.parseInt(tmp) <= B) {
						if(!set.contains(tmp+" "+num))
							ans++;
						set.add(tmp+" "+num);
					}
				}
			}
			System.out.println("Case #"+(count++)+": "+ans);
		}
		reader.close();
	}

}
