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.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;


public class RecycledNumbers {

	public static void main(String [] args) throws NumberFormatException, IOException {
		java.io.BufferedReader r = new java.io.BufferedReader(
				new java.io.FileReader(
						"C:\\Users\\AhmedMTM\\Desktop\\C-small-attempt0.in"));
		int no = Integer.parseInt(r.readLine());
		int[] results = new int[no];
		Arrays.fill(results, 0);
		for (int t = 0; t < no; t++) {
			String[] input = r.readLine().split(" ");

			int A = Integer.parseInt(input[0]);
			int B = Integer.parseInt(input[1]);
			
			for(int j=B; j>A; j--) {
				for(int k=A; k<j; k++) {
					String one = ""+k;
					String two = ""+j;
					if(one.length() == two.length()) {
						for(int l=0; l<one.length(); l++) {
							if(one.equals(two)) {
								//System.out.println(one);
								results[t]++;
							}
							one = one.substring(one.length()-1, one.length())+one.substring(0, one.length()-1);
						}
					}
				}
			}
			
			try {
				FileWriter outFile = new FileWriter(
						"C:\\Users\\AhmedMTM\\Desktop\\output.txt");
				PrintWriter out = new PrintWriter(outFile);
				for (int i = 0; i < results.length; i++) {
					out.println("Case #"+(i+1)+": "+results[i]);
				}

				out.close();
			} catch (IOException e) {
				e.printStackTrace();
			}

		
		}
	}
}
