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.*;
import java.util.*;
public class C {
	public static int a;
	public static int b;
	public static void main(String[] args) throws Exception{
		File f = new File("C-small-attempt0.in");
		Scanner sc = new Scanner(f);
		BufferedWriter bw = new BufferedWriter(new FileWriter("output.txt"));
		int n = sc.nextInt();
		for(int i = 0;i<n;i++) {
			a = sc.nextInt();
			b = sc.nextInt();
			bw.write("Case #"+(i+1)+": "+count(a,b));
			bw.write("\r\n");			
		}
		bw.close();
		sc.close();
	}
	public static int count(int a,int b) {
		int k = 0;
		int temp = a;
		int total = 0;
		int temp2;
		while(temp>0) {
			k++;
			temp /=10;
		}
		int [] v = new int[k+1];
		for(int i = a;i<=b;i++) {
			temp = 0;
			temp2 = i;
			for(int j = 0;j<k;j++) {				
				temp2 =  (temp2%10)*((int)Math.pow(10,k-1)) + temp2/10;
				if(temp2>i&&temp2<=b) {
					v[temp] = temp2;
					temp++;
					for(int t = 0;t<temp-1;t++) {
						if(v[t]==temp2){
							temp--;
							break;
						}
					}					
				}
			}
			total +=temp;			
		}	
		return total;
	}
}