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

public class RecycledNumbers {

	public static void main(String args[]) {

		FileInputStream fstream;
		FileOutputStream out;
		try {
			fstream = new FileInputStream(
					"C:\\Users\\inkrabh\\Downloads\\C-small-attempt0.in");
			out = new FileOutputStream(
					"C:\\Users\\inkrabh\\Downloads\\C-small-attempt0.out");
			DataInputStream in = new DataInputStream(fstream);
			PrintStream p = new PrintStream(out);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine;
			strLine = br.readLine();
			int noOfTestCases = Integer.parseInt(strLine);
			for (int i = 1; i <= noOfTestCases; i++) {
				strLine = br.readLine();
				int result = findNoOfPairs(strLine.split(" ")[0],
						strLine.split(" ")[1]);
				p.println("Case #" + i + ": " + result);
			}
			in.close();
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		}

	}

	public static int findNoOfPairs(String start, String end) {
		int count = 0;
		ArrayList<String> existingList = new ArrayList<String>();
		int begin = Integer.parseInt(start);
		int last = Integer.parseInt(end);
		for (int i = begin; i <= last; i++) {
			String sNum = new String((new Integer(i)).toString());
			existingList.add(sNum);
			String recycles[] = getRecycledNums(sNum);
			ArrayList<String> matchList = new ArrayList<String>();
			for (int j = 0; j < recycles.length; j++) {
				String temp = recycles[j];
				if (!matchList.contains(temp) && !existingList.contains(temp)
						&& temp.charAt(0) != '0' && temp.compareTo(end) <= 0
						&& temp.compareTo(start) >= 0 && !temp.equals(sNum)) {
					matchList.add(temp);
					count++;
				}

			}
		}
		return count;
	}

	static String[] getRecycledNums(String sNum) {
		String s[] = new String[sNum.length() - 1];
		for (int i = 1; i < sNum.length(); i++) {
			String temp = sNum.substring(i) + sNum.substring(0, i);
			s[i - 1] = temp;
		}
		return s;

	}

}
