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.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.Writer;
import java.util.Scanner;


public class Rec {

	static Writer out;
	static Scanner sc;
	public static void main(String[] args) throws IOException {
		sc=new Scanner(new File("input.txt"));
		out = new OutputStreamWriter(new FileOutputStream("out.txt"));
		int num_of_cases=sc.nextInt();
		int a,b;
		
		for (int i = 1; i <= num_of_cases; i++) {
			a=sc.nextInt();
			b=sc.nextInt();
			solve(a,b,i);
		}
		//System.out.println("Done");
		out.close();
	}
	private static void solve(int a, int b, int case_num) throws IOException {
		int len=String.valueOf(a).length();
		int count=0;
		int t;
		boolean [][]arr=new boolean[b+1][b+1];
		for(int i=0;i<b+1;i++){
			for (int j = 0; j < b+1; j++) {
				arr[i][j]=false;
			}
		}
		for(int k=a;k<b;k++){
			
			for (int i = 1; i <len ; i++) {			
				t=(int) (k/Math.pow(10, i) + k%Math.pow(10,i) * Math.pow(10,len-i) );
				if(t>a && t<=b && k<t){
					
					if(arr[k][t]==true){
						//System.out.println("***************************************************************************");
						count--;
					}
					arr[k][t]=true;
					count++;
					//System.out.println(a+", "+k+", "+t+", "+b);
				}
			}

		}
		//System.out.println("Case #"+case_num+": "+count);
		out.append("Case #"+case_num+": "+count+'\n');
	}
	
	

}
