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.FileReader;


public class RecycledNumbers {

	public static void main(String[] args) {
		RecycledNumbers temp = new RecycledNumbers();
		temp.findPairs();
	}
	
	void findPairs(){
		String myFileName = "D:\\testcase.txt";
		try {
			BufferedReader myReader = new BufferedReader(new FileReader(myFileName));
			int myTestCases = 0;
			myTestCases = Integer.parseInt(myReader.readLine());
			
			for(int i=0; i<myTestCases; i++){
				String[] temp = myReader.readLine().split(" ");
				int A = Integer.parseInt(temp[0]);
				int B = Integer.parseInt(temp[1]);
				int j = A;
				int count = 0;
				int size = (j+"").length();
				
				while(j <= B){
					
					int[] myNumbers = new int[size];
					int myNumIndex = 0;
					String newNumber = "";
					
					for(int k=0; k < size-1; k++){
						
						if(size < 2)
							break;
						String number = new String(""+j);
						
						if(k == 0){
							if(number.charAt(size - 1) == '0'){
								newNumber = ""+number.charAt(size - 1)+number.substring(0, size - 1);
								continue;
							}
							newNumber = ""+number.charAt(size - 1)+number.substring(0, size - 1);
						}else{
							if(newNumber.charAt(size - 1) == '0'){
								newNumber = ""+newNumber.charAt(size - 1)+newNumber.substring(0, size - 1);
								continue;
							}
							newNumber = ""+newNumber.charAt(size - 1)+newNumber.substring(0, size - 1);
						}
						
						int check = Integer.parseInt(newNumber);
						if(check <= B && check > j && check >= A){
							boolean found = false;
							for(int z=0; z < size; z++){
								if(myNumbers[z] == check)
									found = true;
							}
							if(!found){
								count++;
								myNumbers[myNumIndex]=check;
								myNumIndex = myNumIndex+1;
								//System.out.println("("+j+", "+newNumber+")");
							}
						}
					}
					j++;
				}
				System.out.println("Case #"+(i+1)+": "+count);
			}
			} catch (NumberFormatException e) {
				e.printStackTrace();
			} catch (Exception e) {
				e.printStackTrace();
			}
	}

}
