import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

public class Recycled {
	public static void main(String[] args) throws Exception{
		String inputFile = "C-small-attempt0.in";
		
		BufferedReader input = new BufferedReader(new InputStreamReader(new FileInputStream(inputFile)));
		BufferedWriter output = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("output")));
		long num_cases = Long.parseLong(input.readLine());
		int current_case = 0;
		
		while (current_case < num_cases){
			current_case++;
			
			String[] fields = input.readLine().split(" ");
			int A = Integer.parseInt(fields[0]);
			int B = Integer.parseInt(fields[1]);
			int total = 0;
			
			for (int n = A; n < B; n++){
				for (int m = n+1; m <= B; m++){
					if (isRecycled(n,m)) total++;
				}
			}
			
			System.out.println("Case #" + current_case + ": " + total);
			output.write("Case #" + current_case + ": " + total + "\n");
		}
		output.close();
	}

	private static boolean isRecycled(int n, int m) {
		String sn = ""+n;
		String sm = ""+m;
		if (sn.length() != sm.length()) return false;
		int totaln = 0, totalm = 0;
		for (int i = 0; i < sn.length(); i++){
			totaln += sn.charAt(i);
			totalm += sm.charAt(i);
		}
		if (totaln != totalm) return false;
		for (int i = 0; i < sn.length()-1; i++){
			sm = sm.charAt(sm.length() - 1) + sm.substring(0, sm.length() - 1);
			if (sm.equals(sn)) return true;
		}
		return false;
	}
}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashSet;
import java.util.Set;

public class G3 {

    public static void main(String[] args) throws Exception {
        BufferedReader in = new BufferedReader(new FileReader("d:\\C-small-attempt0.in"));
        int n = Integer.parseInt(in.readLine());
        BufferedWriter out = new BufferedWriter(new FileWriter("d:\\g3o.txt"));
        int from, to;
        for (int i = 1; i <= n; i++) {
            String[] s = in.readLine().split(" ");
            from = Integer.parseInt(s[0]);
            to = Integer.parseInt(s[1]);
            int answer = solve(from, to);
            System.out.println("Case #" + i + ": " + answer);
            out.write("Case #" + i + ": " + answer);
            out.newLine();
        }
        out.close();
    }

    private static int solve(int from, int to) {
        int result = 0;
        int digits = (int) Math.floor(Math.log10(from));
        Set<String> set = new HashSet<String>();
        for (int i = from; i <= to; i++) {
            int base10 = 10;
            int baseBig10 = (int) Math.pow(10., digits);
            for (int l = 0; l < digits; l++) {
                int cycled = baseBig10 * (i % base10) + (i/base10);
                if (cycled != i && cycled>=from && cycled <= to) {
                    result++;
                    if (!set.add(String.valueOf(i)+" "+cycled))
                    System.err.println(i +" <->"+cycled);
                }
                base10 *= 10;
                baseBig10 /= 10;
            }
        }
        return set.size()/2;
    }
}
