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

public class Recycle {
	public static void main(String args[]) {
		try {
			InputStreamReader inReader = new InputStreamReader(new FileInputStream("input.txt"));
			BufferedReader br = new BufferedReader(inReader);
			
			File out = new File("output.txt");
			Writer output = new BufferedWriter(new FileWriter(out));
			
			int amount = Integer.parseInt(br.readLine());
			
			for (int i=0; i < amount; i++) {
				output.write("Case #" + (i+1) + ": ");
				String line = br.readLine();
				
				int min = Integer.parseInt(line.split(" ")[0]);
				int max = Integer.parseInt(line.split(" ")[1]);
				
				int result = 0;
				int digits = 1;
				int tmp = max;
				
				while (tmp/10 > 0) {
					tmp /= 10;
					digits++;
				}
				
				int[] assist = new int[digits];
				for (int l=0; l < digits; l++)
					assist[l] = 0;
				
				for (int j=min; j <= max; j++) {
					int number = j;
					int counter = 0;
					for (int k=1; k < digits; k++) {
						int newNumber = (int) ((int) (number%Math.pow(10, k)) * Math.pow(10, digits-k) + (number/Math.pow(10, k)));
						if (newNumber > number && newNumber <= max) {
							for (int l=0; l < counter; l++) {
								if (assist[l] == newNumber)
									result--;
							}
							
							assist[counter++] = newNumber;
							result++;
						}
					}
				}
				
				output.write(result + "\n");
			}
			
			output.close();
		}
		
		catch (Exception e) {
			e.printStackTrace();
		}
	}
}