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.util.*;
import java.io.*;
public class c{
	public static void main(String[] args)throws IOException{
		Scanner br = new Scanner(new File("c.in"));
		PrintWriter out = new PrintWriter(new File("c.out"));
		int cases = br.nextInt();
		for(int i = 0;i<cases;i++){
			int a = br.nextInt();
			int b = br.nextInt();
			
			int count = 0;
			for(int j = a;j<=b;j++){
				String cur = Integer.toString(j);
				HashSet<String> seen = new HashSet<String>();
				for(int k = 1;k<cur.length();k++){
					String temp = cur.substring(k, cur.length())+cur.substring(0, k);
					if(!seen.contains(temp)){
						seen.add(temp);
						int num = Integer.parseInt(temp);
						if(num <= j || num < a || num > b){
							continue;
						
						}
						count++;
					}
				}
			}
			out.println("Case #"+(i+1)+": "+count);
		}
		out.close();
	}

}
