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.Scanner;

public class Problem3 {
    public static void main(String args[]){
        Scanner in= new Scanner(System.in);
        Scanner rin= new Scanner(in.nextLine());
        int T = rin.nextInt();
        for(int l=0;l<T;l++){
            rin= new Scanner(in.nextLine());
            int lower = rin.nextInt();
            int upper = rin.nextInt();
            int count=0;
            while(lower<upper){
                for(int m=lower+1;m<=upper;m++){
                    if(isRecycledPair(lower,m)){
                        count++;
                    }
                }
                lower++;
            }
            System.out.println("Case #"+(l+1)+": "+count);
        }
        
    }
    
    static String rightRotateString(String str){
        char strC[]=str.toCharArray();
        int i=0;
        char temp=strC[strC.length-1];
        for(i=strC.length-1;i>0;i--){
            strC[i]=strC[i-1];
        }
        strC[i]=temp;
        return (new String(strC));
    }
    
    static boolean isRecycledPair(int n,int m){
        String nS=Integer.toString(n);
        String mS=Integer.toString(m);
        if(nS.matches(mS))
            return true;
        for(int i=0;i<nS.length()-1;i++){
            nS=rightRotateString(nS);
            if(nS.matches(mS)){
                return true;
            }
        }
        return false;
    }
}