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 egWo;

import java.util.ArrayList;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class Cl {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();

		for (int l = 1; l <= T; l++) {
			in.nextLine();
			int n = in.nextInt();
			int m = in.nextInt();
			int count = 0;
			for (int i = n; i < m; i++) {
				int uv = 0;
				for (int j = 1000000; j >= 1; j = j / 10) {
					if (m / j > 0 && m / j < 10) {
						uv = j;
					}
				}
				ArrayList revI = new ArrayList();
				int s = 10;
				for (int c = uv; c >= 10; c = c / 10) {
					int h = i / c;
					int t = i % c;
					int rev = (t * s) + h;
					s *= 10;
					revI.add(rev);
				}
				Set set = new HashSet(revI);
				for (Object j : set) {
					if (i < ((Integer) j).intValue()
							&& ((Integer) j).intValue() <= m) {
						count++;
					}
				}
			}
			System.out.format("\nCase #%d: %d", l, count);
		}		
	}
}
