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.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashSet;
import java.util.Set;


public class GCJ3 {
	
	public static int pow(int num, int p) {
		int n = 1;
		while (p > 0) {
			p--;
			n *= num;
		}
		return n;
	}
	
	public static int exp(int num) {
		int e = 0;
		while (num > 0) {
			e++;
			num /= 10;
		}
		return e;
	}
	
	public static void main(String[] args) {
		try {
			BufferedReader br = new BufferedReader(new FileReader(new File("input.txt")));
			BufferedWriter bw = new BufferedWriter(new FileWriter(new File("output.txt")));
			String firstLine = br.readLine();
			int lineNum = Integer.parseInt(firstLine);
			for (int i=0; i<lineNum; i++) {
				Set<Long> set = new HashSet<Long>();
				String line = br.readLine();
				String[] segs = line.split(" ");
				int a = Integer.parseInt(segs[0]);
				int b = Integer.parseInt(segs[1]);
				int result = 0;
				int exp = exp(a);
				long off = (long)(b+1);
				for (int num=a; num<b; num++) {
					for (int j=1; j<exp; j++) {
						int key = pow(10, j);
						int key2 = pow(10, exp-j);
						int first = num / key;
						int second = num % key;
						int recycle = second * key2 + first;
						if (recycle > num && recycle <= b) {
							if (set.contains(off*num+recycle)) {
							} else {
								set.add(off*num+recycle);
								result++;
							}
						}
					}
				}
				
				bw.write("Case #" + (i+1) + ": " + result);
				if (i != (lineNum-1))
					bw.newLine();
			}
			bw.flush();
			bw.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
}
