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;
	}
}

package recyclednumbers;

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

/**
 *
 * @author Kocmi
 */
public class RecycledNumbers {

    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            StringTokenizer st;

            st = new StringTokenizer(br.readLine());
            int tests = Integer.parseInt(st.nextToken());
            int[] results = new int[tests]; //final result
            int A,B;
            
            for (int i = 0; i < tests; i++) {
                st = new StringTokenizer(br.readLine());
                A = Integer.parseInt(st.nextToken());
                B = Integer.parseInt(st.nextToken());
                
                results[i] = recycled(A,B,Integer.toString(A).length());
            }
            
            for (int i = 0; i < tests; i++) {
                System.out.println("Case #"+(i+1)+": "+results[i]);
            }
        } catch (Exception ex) {
        }
    }
    
    public static int recycled(int A, int B, int length){
        int result = 0;
        for (int n = A; n < B; n++) {
            //check n
            result += check(n,B,length);
        }
        
        return result;
    }
    
    public static int check(int n, int B, int length){
        int cycles = 0;
        int m = n;
        int rest;
        boolean a;
        int[] correct = new int[7];
        
        for (int i = 0; i < length-1; i++) {
            rest = m%10;
            m = (m/10);
            m = m+rest*(int)Math.pow(10,(length-1));
            
            if(n<m && m<=B){
                a = true;
                for (int j = 0; j < cycles; j++) {
                    if(correct[j]==m){
                        a=false;
                    }
                }
                if(a){
                    correct[cycles] = m;
                    cycles++;
                }
            }
        }
        return cycles;
    }
}
