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 google.code.jam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.ListIterator;

public class RecycledNumbers {

	final static String fileNameIn = "C-large.in";
	final static String fileNameOut = "C-large.out";

	private static int solve(int A, int B) {
		HashMap<String, Integer> hashMap = new HashMap<String, Integer>();
		for (int i = A; i <= B; i++) {
			String n = new Integer(i).toString();
			String key = minimum(n);
			if (Integer.valueOf(n) >= A && Integer.valueOf(n) <= B) {
				if (!hashMap.containsKey(key)) {
					hashMap.put(key, 1);
				} else {
					hashMap.put(key, hashMap.get(key) + 1);
				}
			}
		}
		int count = 0;
		for (String key : hashMap.keySet()) {
			Integer value = hashMap.get(key);
			count = count + (value * (value - 1) / 2);
		}
		return count;
	}

	private static String minimum(String input) {
		String min = input;
		for (int i = 0; i < input.length(); i++) {
			if (Integer.valueOf(shift(input, i)) < Integer.valueOf(min)) {
				min = shift(input, i);
			}
		}
		return min;
	}

	private static String shift(String input, int n) {
		return input.substring(n, input.length()) + input.substring(0, n);
	}

	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader(fileNameIn));
		BufferedWriter out = new BufferedWriter(new FileWriter(fileNameOut));
		int testCases = Integer.parseInt(in.readLine());
		for (int i = 0; i < testCases; i++) {
			String[] elements = in.readLine().split(
					new Character((char) 32).toString());
			List<Integer> values = new ArrayList<Integer>();
			for (String v : elements) {
				values.add(Integer.valueOf(v));
			}
			ListIterator<Integer> iterator = values.listIterator();
			int A = iterator.next();
			int B = iterator.next();
			out.write(String.format("Case #%s: %s\n", i + 1, solve(A, B)));
		}
		in.close();
		out.close();
	}

}
