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));
			
		}
		
		
		

	}
	
	
}
package qualificationRound;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;

public class Q3Recycled {

	/**
	 * @param args
	 * @throws FileNotFoundException 
	 */
	public static void main(String[] args) throws FileNotFoundException {
		Scanner sc = new Scanner(new File("qualificationRound/C-small-attempt1.in"));
		PrintWriter out = new PrintWriter(new File("qualificationRound/out.txt"));

		int T = sc.nextInt();
		sc.nextLine();

		for (int tc = 1; tc <= T; tc++) {
			out.print("Case #"+tc+": ");
			System.out.print("Case #"+tc+": ");
			
			int A = sc.nextInt();
			int B = sc.nextInt();
			int count = 0;
			for (int n = A; n <= B; n++) {
				if (n >= 10) { // must be two digits at least
					String s = ""+n;

					/*boolean same = true;
					for (int j=1; j<s.length(); j++) {
						if (s.charAt(0) != s.charAt(j)) {
							same = false;
							break;
						}
					}
					if (!same) { // can't be a number like 88888
						if (s.length()%2 == 0 && s.substring(0,s.length()/2).equals(s.substring(s.length()/2,s.length()))) // if repeated sequence
							count += s.length()/2-1;
						else
							count += s.length()-1;
					} */

					String[] s2 = getStrings(s);
					for (int i=0; i<s2.length; i++) {
						try {
							int m = Integer.parseInt(s2[i]);
							if (n<m && m<=B)
								count++;
						} catch (Exception e) {
							break; // no more candidates
						}
					}
				}
			}
			out.println(count);
			System.out.println(count);
			out.flush();
		}
		out.close();
	}

	public static String[] getStrings(String s) {
		String[] out = new String[s.length()-1];
		for (int i=0; i<out.length; i++) {
			int split = s.length()-i;
			String newString = s.substring(split-1,s.length())+s.substring(0,split-1);
			boolean isnew = true;
			for (int j=0; j<i; j++)
				if (out[j].equals(newString)) {
					isnew = false;
					break;
				}
			if (isnew)
				out[i]=newString;
		}
		return out;
	}
}