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.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.StringTokenizer;

public class Main {

	public static int keta;
	public static void main(String[] args) throws Exception {

		FileReader in = new FileReader("F:\\download\\C-large.in");
		BufferedReader br = new BufferedReader(in);
		FileWriter out = new FileWriter("F:\\download\\out.txt");
		BufferedWriter bw = new BufferedWriter(out);

		int t = Integer.parseInt(br.readLine());
		for (int c = 0; c < t; c++){
			String line = br.readLine();
			StringTokenizer aSt = new StringTokenizer(line, " ");
			int a = Integer.valueOf(aSt.nextToken()).intValue();
			int b = Integer.valueOf(aSt.nextToken()).intValue();

			keta = (int)Math.log10(a) + 1;
			int pairs = 0;
			for (int n = a; n <= b; n++){
				pairs += pairs(a, b, n);
			}

			bw.write(String.format("Case #%d: %d\n", c+1, pairs));
		}
		
		br.close();
		in.close();
		bw.close();
		out.close();

	}

	public static int pairs(int a, int b, int num){
		int numbers = 1;
		int[] stock = new int[keta];
		stock[0] = num;
		
		for (int x = 1; x < keta; x++){
			int recycle = (num % (int)Math.pow(10, keta - x)) * (int)Math.pow(10, x) + (int)(num / (int)Math.pow(10, keta - x));
			if ((a <= recycle)&&(recycle <= b)){
				if (recycle < num) return 0;
				boolean flag = false;
				for (int st = 0; st < numbers; st++){
					if (stock[st] == recycle) flag = true;
				}
				if (!flag){
					stock[numbers] = recycle;
					numbers ++;
				}
			}
		}

		return numbers * (numbers - 1) / 2;
	}
}
