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.DataInputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;

public class RecNum {

	public static void main(String[] args) throws Exception {
		// long start = System
		String filename = "D:\\Hardik\\workspace\\CodeJam\\C-small-attempt2.in";
		FileInputStream file = new FileInputStream(filename);
		DataInputStream in = new DataInputStream(file);
		int testCases = Integer.parseInt(in.readLine());
		FileOutputStream fos = new FileOutputStream(
				"D:\\Hardik\\workspace\\CodeJam\\Output.txt");
		int a, b;
		int caseNo = 1;
		String output = "";
		while (testCases > 0) {
			String input = in.readLine();
			String nu[] = input.split(" ");
			a = Integer.parseInt(nu[0]);
			b = Integer.parseInt(nu[1]);
			testCases--;
			output += "Case #" + Integer.toString(caseNo++) + ": "
					+ Integer.toString(solve(a, b)) + "\n";
		}
		fos.write(output.getBytes());
		fos.close();
		file.close();
	}

	public static int solve(int a, int b) {
		int output = 0;
		for (int i = a; i <= b; i++) {
			for (int j = a; j <= b; j++) {
				if (isRecycledNumber(i, j)) {
					output++;
					j += 5;
				}
			}
		}
		return (output / 2);
	}

	public static boolean isRecycledNumber(int number1, int number2) {
		String n1 = Integer.toString(number1), n2 = Integer.toString(number2);
		if (number1 < 10) {
			return false;
		}
		if (n1.length() != n2.length()) {
			return false;
		}
		if (number1 == number2) {
			return false;
		}
		for (int i = 1; i <= n1.length(); i++) {
			for (int j = 1; j <= n2.length(); j++) {
				String n3, n4, n5, n6;
				n3 = n1.substring(0, i);
				n4 = n1.substring(i, n1.length());
				n5 = n2.substring(0, j);
				n6 = n2.substring(j, n2.length());
				int num1, num2, num3, num4;
				num1 = Integer.parseInt(n3 + n4);
				num2 = Integer.parseInt(n4 + n3);
				num3 = Integer.parseInt(n5 + n6);
				num4 = Integer.parseInt(n6 + n5);
				if (num1 == num3)
					return true;
				else if (num1 == num4)
					return true;
				if (num2 == num3)
					return true;
				else if (num2 == num4)
					return true;
			}
		}
		return false;
	}

}