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.util.HashSet;
import java.util.Scanner;
import java.util.Set;

/**
 * Google Code Jam 2012
 * 
 * @author 7henick
 */
public class ProblemC {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        sc.nextLine();

        // A <= n < m <= B
        for (int i = 0; i < T; i++) {
            int A = sc.nextInt();
            int B = sc.nextInt();

            int count = 0;

            for (int n = A; n < B; n++) {
                String nString = String.valueOf(n);
                Set<Integer> intSet = new HashSet<Integer>();

                for (int j = 1; j < nString.length(); j++) {
                    char idx = nString.charAt(j);

                    if (idx != '0') {
                        String mString = nString.substring(j)
                                + nString.substring(0, j);
                        int m = Integer.valueOf(mString);

                        if (n < m && m <= B) {
                            intSet.add(m);
                        }
                    }
                }
                count += intSet.size();
            }

            System.out.println("Case #" + (i + 1) + ": " + count);
            if (sc.hasNextLine()) {
                sc.nextLine();
            }
        }
    }

    public static boolean isValid(int n, int m, int B) {
        return n < m && m <= B;
    }
}
