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.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        try {
            Scanner in = new Scanner(new FileReader("in.txt"));
            PrintWriter out = new PrintWriter(new FileWriter("out.txt"), true);

            int N = in.nextInt();
            for (int I = 1; I <= N; I++) {
                int a = in.nextInt();
                int b = in.nextInt();
                int count = 0;
                for (int i = a; i < b; i++) {
                    char m[] = (i + "").toCharArray();
                    //out.println("m: "+ Arrays.toString(m));
                    char[] mm = m.clone();
                    Arrays.sort(mm);
                    for (int j = i + 1; j <= b; j++) {
                        char n[] = (j + "").toCharArray();
                        char[] nn = n.clone();
                        Arrays.sort(nn);

                        if (Arrays.equals(nn, mm)) {
                            for(int k = 1; k < n.length; k++){
                                String s = new String(Arrays.copyOfRange(n.clone(), k, n.length));
                                s += new String(Arrays.copyOf(n.clone(), k));
                                if(s.equals(new String(m))){
                                    count++;
                                    break;
                                }
                            }
                        }

                        //out.println("n: "+ Arrays.toString(n));
                        /*int index = 0;
                        for (int k = n.length - 1; k >= index; k--) {
                            if (m[index] == n[k]) {
                                char c = n[k];
                                for(int kk = k; kk > index; kk--){
                                    n[kk] = n[kk - 1];
                                }
                                n[index] = c;
                                index++;
                            }
                        }
                        if (index == n.length - 1) {
                            count++;
                            out.println("m: "+ Arrays.toString(m));
                            out.println("n: "+ Arrays.toString(n));
                        }      */
                    }
                }
                out.println("Case #" + I + ": " + count);
            }
        } catch (Exception e) {
            e.printStackTrace();
        }
    }
}