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.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.util.ArrayList;


public class ProblemB {

	public static void main(String[] args) throws IOException {
		BufferedReader bf = new BufferedReader(new FileReader("C-small-attempt0.in"));
		System.setOut(new PrintStream("salida"));

//		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
		String linea = bf.readLine();
		int casos = Integer.parseInt(linea);
		int cont = 1;
		while(casos>0){
			linea = bf.readLine();
			String[] nums = linea.split(" ");
			int result = 0;
			int a = Integer.parseInt(nums[0]);
			int b = Integer.parseInt(nums[1]);
			
			for (int i = a; i <=b; i++) {
				int actual = i;
				ArrayList<Integer> transpuestos = trasponer(actual);
				result+=generarParejas(actual, b,transpuestos);
			}
			System.out.println("Case #"+cont+": "+result);
			cont++;
			casos--;
		}
	}


	private static int generarParejas(int actual, int b, ArrayList<Integer> lista) {
		int cont = 0;
		for (int i = actual+1; i <=b; i++) {
			if(lista.contains(i))
				cont++;
		}
		return cont;
	}


	private static ArrayList<Integer> trasponer(int actual) {
		String ini = actual+"";
		ArrayList<Integer> resp = new ArrayList<Integer>();
		for (int i = 0; i < ini.length()-1; i++) {
			String s = ini.substring(ini.length()-1-i)+ini.substring(0,ini.length()-1-i);
			resp.add(Integer.parseInt(s));
		}
		return resp;
	}
}