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.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.util.LinkedList;
import java.util.Map;
import java.util.StringTokenizer;


public class RecycleNum{
	private Map<String, String> map = new HashMap<String, String>();

	public static void main(String[] args) throws IOException {
	//	new Thread(new Solution()).start();
		RecycleNum sol = new RecycleNum();
		sol.start();
	}

	public RecycleNum() {
	}

	public void start() throws IOException {
		BufferedReader br = new BufferedReader(new FileReader("C-small-attempt0.in"));
		BufferedWriter wStream=new BufferedWriter( new FileWriter("C-small_attempt0.out"));
		String input;
		StringTokenizer st=null;
		int T=0;
		if((input=br.readLine()) != null) {
			st=new StringTokenizer(input);
			T=Integer.parseInt(st.nextToken());
		}
		for(int i=0;i<T;i++)
		 {
			if((input=br.readLine()) != null) {
				st=new StringTokenizer(input);
				int A = Integer.parseInt(st.nextToken());
				int B = Integer.parseInt(st.nextToken());
				int recyclePair =0;
				for(int n=A;n<B;n++){
					for(int m=n+1;m<=B;m++){
						recyclePair += checkRecyclePair(n,m);
					}
				}
				
				System.out.println(recyclePair);
				wStream.write("Case #"+(i+1)+": "+recyclePair);
				wStream.newLine();
			//	out.print("Case #"+(testNumber+1)+": "+solve(mainList,oList,bList));
				}
			System.out.println("_________________");
			
		 }
		wStream.close();
	}
	
	public int checkRecyclePair(int n, int m){
		String nStr = Integer.toString(n);
		String mStr = Integer.toString(m);
		//System.out.println(nStr+"_"+mStr);
		String temp;
		if(nStr.length() == mStr.length()){
			for(int i=0;i<mStr.length();i++){
				if(mStr.charAt(i) == nStr.charAt(0)){
					temp = mStr.substring(i)+ mStr.substring(0, i);
					if(nStr.compareTo(temp) == 0){
					//	System.out.println(nStr+"_"+temp);
						return 1;
					}
				}
			}
			return 0;
		}
		else return 0;
	}
	
}