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.*;
public class ProblemC {
    public static void main(String args[]) {
        try {
            BufferedReader br = new BufferedReader(new FileReader("E:\\test.txt"));
            int no;
            no= Integer.parseInt(br.readLine());
            int casen=0,i,j;
            int a,b,count;
            String temp,t,u;
            String output;
            output="";
            String spl[];
            String memory,fp,lp;
            while( casen < no ) {
                temp = br.readLine();
                output += "Case #"+(casen+1)+": ";
                spl = temp.split(" ");
                a = Integer.parseInt(spl[0]);
                b = Integer.parseInt(spl[1]);
                count = 0;
                memory = "";
                for(i=a;i<=b; i++) {
                	t = i+"";
                	for(j=1;j<t.length();j++) {
                		u= t.substring(j);
                		u+= t.substring(0,j);
                		//System.out.println(u);
                		if( !u.startsWith("0") && Integer.parseInt(u) < i && Integer.parseInt(u)<= b && Integer.parseInt(u) >= a)
                		{
                			if( t.length() % 2 == 0 ) {
                				fp= t.substring(0,t.length()/2);
                				lp = t.substring(t.length()/2);
                				if( fp.equals(lp) ) {
                					if(!memory.contains(Integer.parseInt(u)+" "+i)) {
                						count++;
                						memory += Integer.parseInt(u) + " " + i+"\n";
                					}
                				}
                				else {
                					count++;
                				}
                			}
                			else {
                				count++;
                			}
                			/*if( memory.contains(Integer.parseInt(u)+" "+i) )
                				System.out.println(Integer.parseInt(u)+"  "+i);
                			else
                			{
                				count++;
                				memory += Integer.parseInt(u) + " " + i+"\n";
                			}*/
                		}
                	}
                }
                output += count;
                if( casen != no-1 )
                    output += "\n";
                casen++;
            }
            BufferedWriter bw = new BufferedWriter( new FileWriter("E:\\result.txt"));
            bw.write(output);
            bw.close();
            br.close();
        }
        catch( Exception e )
        {
            e.printStackTrace();
        }
    }
}