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.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashMap;
import java.util.Scanner;

public class Main {

	/**
	 * @param args
	 * @throws IOException
	 */
	public static void main(String[] args) throws IOException {
		Scanner input = new Scanner(new File("C-small-attempt0.in"));
		FileWriter out = new FileWriter("out.txt");

		int lineNumber = input.nextInt();
		for (int i = 0; i < lineNumber; i++) {
			int a = input.nextInt();
			int b = input.nextInt();
			int count = 0;
			int div = 1;
			for (int j = a; j < b; j++) {
				for (int k = j + 1; k <= b; k++) {
					div = 1;
					int length = 0;
					while (j / div > 0) {
						length++;
						div *= 10;
					}
					int max = div;
					div = 10;
					if (j == 334 && k == 433)
						System.out.println(length+" "+max);
					for (int velicina = 0; velicina < length; velicina++) {
						if (j == 334 && k == 433) {
							System.out.println("---------");
							System.out.println(j % div + "	" + k / (max / div));
							System.out.println(k % (max / div) + "	" + j / (div));
						}
						if (j % div == k / (max / div)
								&& k % (max / div) == j / div) {
							count++;
							break;
						}
						div*=10;
					}

				}
			}
			String solution = "Case #" + (i + 1) + ": " + count;
			solution += System.getProperty("line.separator");
			out.write(solution);

		}
		out.close();
		input.close();
	}
}
