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.*;
import java.util.HashSet;
import java.util.StringTokenizer;

public class Main {

    public static void main(String[] args) throws IOException {

        String file = "C-small-attempt0";
        BufferedReader in = new BufferedReader(new FileReader(file + ".in"));
        FileWriter archivo = new FileWriter(file+".out");
        PrintWriter outs = new PrintWriter(archivo);
        outs.flush();
        //BufferedReader in = new BufferedReader(new InputStreamReader(System.in));

        int n = Integer.parseInt(in.readLine());
        for (int i = 1; i <= n; i++) {
            HashSet<String> k = new HashSet<String>();
            StringTokenizer token = new StringTokenizer(in.readLine());
            int a = Integer.parseInt(token.nextToken()), b = Integer.parseInt(token.nextToken());
            for (int j = a; j <= b; j++) {
                String r = String.valueOf(j);
                if (j < 100) {
                    String test1 = new StringBuilder(r).reverse().toString();

                    if (!r.equals(test1)) {
                        int comparer = Integer.parseInt(test1);

                        if (a <= comparer && comparer <= b) {
                            //System.out.println(comparer);
                            int lol = Integer.parseInt(r);
                            String container = Math.max(comparer, lol) + " - " + Math.min(comparer, lol);
                            //System.out.println(container);
                            if (!k.contains(container)) {
                                k.add(container);
                            }
                        }
                    }
                } else {
                    //System.out.println(r.length());
                    for (int c = 1; c < r.length(); c++) {

                        String test1 = r.substring(c);
                        String test2 = r.substring(0, c);
                        //System.out.println(test1+test2);
                        if (!r.equals(test1 + test2)) {
                            int comparer = Integer.parseInt(test1+test2);

                            if (a <= comparer && comparer <= b) {
                                //System.out.println(comparer);
                                int lol = Integer.parseInt(r);
                                String container = Math.max(comparer, lol) + " - " + Math.min(comparer, lol);
                                //System.out.println(container);
                                if (!k.contains(container)) {
                                    k.add(container);
                                }
                            }
                        }

                    }
                }
            }
            outs.println("Case #" + i + ": " + k.size());
        }





        outs.close();
        in.close();
        System.exit(0);

    }
}
