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;

class ProbC{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for(int i=0;i<T;i++){
			//boolean flag[] = new boolean[2000001];
			int A, B;
			A = sc.nextInt();
			B = sc.nextInt();
			int count = 0;
			for(int j=A;j<=B;j++){
				//if(!flag[j]){	// kalo J blm crossed, check
					String check = j+"";
					int ndigit = check.length();
					boolean ada = false;
					int nomnom = 0;
					boolean flag[] = new boolean[2000001];
					for(int k=1;k<=ndigit-1;k++){
						if(check.charAt(check.length()-k) != '0'){
							int depan = Integer.parseInt(check.substring(0,check.length()-k));
							int belakang = Integer.parseInt(check.substring(check.length()-k));
							int hasil = (int)((Math.pow(10,ndigit-k)*belakang)+depan);
							//System.out.println("dari "+j+" hasil "+hasil);
							if(hasil != j && hasil >= A && hasil <= B){
//								System.out.println("Recycle "+hasil+" from "+j);
								if(j < hasil){
									//System.out.println("Recycle "+hasil+" "+j);
									if(!flag[hasil]){
										flag[hasil] = true;
										//ada = true;
										count++;
									}									
								}
							}
						}
					}
				//}
			}
			int kount = 0;
			/*for(int j=A;j<=B;j++){
				if(flag[j]){
					//System.out.println("recycle "+j);
					kount++;
				}
			}*/
			System.out.println("Case #"+(i+1)+": "+count);
		}
	}
}