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

class RecycledNumbers{
	
	
	
	int getcount(int small,int large){
		int count = 0;
		for(int currnum = small; currnum < large; currnum++){
			int permut = currnum;
			int no_of_digits = 0;
			while(permut > 0){
				permut = permut/10;
				no_of_digits++;
			}
			int lastDigit = currnum % 10;
			permut = currnum / 10;
			permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
			while(permut != currnum){
				
				if(permut >= currnum && permut <= large){
					
					count++;
				}
				lastDigit = permut % 10;
				permut = permut / 10;
				permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
				
			}
			
		}
		
		return count;
	}
	
	public static void main(String args[]){
		RecycledNumbers d = new RecycledNumbers();
		
		int no_of_cases = 0;
		String input = "";
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		try{
			no_of_cases = Integer.parseInt(br.readLine());
		}
		catch(Exception e){
			System.out.println("First line is not a number");
		}
		
		for(int i=1; i <= no_of_cases;i++){
			try{
				input = br.readLine();
			}
			catch(Exception e){
				System.out.println("Number of test cases different from the number mentioned in first line");
			}
			
			System.out.print("Case #" +i+": ");
			
			StringTokenizer t =  new StringTokenizer(input);
			int small=0,large=0;
			if(t.hasMoreTokens()){
				small = Integer.parseInt(t.nextToken());
			}
			if(t.hasMoreTokens()){
				large = Integer.parseInt(t.nextToken());
			}
			System.out.println(d.getcount(small,large));
			
		}
		
		
		

	}
	
	
}
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashMap;

public class Main {

	public static void main(String[] args) {
		try {
			BufferedReader br = new BufferedReader(new FileReader("C-small-attempt1.in"));
			PrintWriter bw = new PrintWriter(new FileWriter("C-small-attempt1.out"));
			
			int num = Integer.parseInt(br.readLine());
			
			for (int i = 0; i < num; i++) {
				String[] content=br.readLine().split("[ ]");
				int start=Integer.parseInt(content[0]);
				int end=Integer.parseInt(content[1]);
				int count=0;
				for (int j = start; j <end; j++) {
					int j_num=0;
					int temp=j;
					while(temp!=0)
					{
						temp/=10;
						j_num++;
					}
					int j2_end=end;
					int j_end=(int)Math.pow(10, j_num)-1;
					if(j_end<end)
						j2_end=j_end;
					String srcString=String.valueOf(j);
					//System.out.println("j"+srcString+","+j2_end);
//					char src[srcString.length()];
//					int length=srcString.length();
//					for (int k = 0; k < length; k++) {
//						src[i]=srcString.charAt(i);
//					}
					for (int j2 = j+1; j2 <=j2_end; j2++) {
						String desString=j2+"";
						int lengths=desString.length();
						char[] des = new char[lengths*2];
						for (int k = 0; k < lengths; k++) {
							des[k]=desString.charAt(k);
						}
						for (int l = 0; l < lengths; l++) {
							des[lengths+l]=des[l];
							String reString=new String(des, l+1, lengths);
							//System.out.println(reString+"l");
							if (reString.equals(srcString)) {
								count++;
								break;
							}
						}
					}
				}
				bw.println("Case #"+(i+1)+": "+count );
			}
			
			br.close();
			bw.close();
			
		} catch (IOException e) {
			e.printStackTrace();
		}
	}

}
