import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;


public class GoogleC {
	public String szamol(String input){
		String result="";
		String a=input;
		Integer min=Integer.parseInt(a.substring(0,a.indexOf(' ')));
		a=a.substring(a.indexOf(' ')+1);
		Integer max=Integer.parseInt(a);
		Long count=0l;
		for(Integer i=min; i<=max; i++){
			String e1=i.toString();
			Set<Integer> db=new HashSet<Integer>(); 
			for (int j=1; j<e1.length();j++){
				
				String e2=e1.substring(j)+e1.substring(0,j);
				Integer k=Integer.parseInt(e2);
				if (k>i && k<=max){
					db.add(k);
					//System.out.println(e1+"\t"+e2);
				}
				
			}
			count+=db.size();
		}
		
		return count.toString();
	}
	public static void main(String[] args) {
		GoogleC a=new GoogleC();
		//String filename="input.txt";
		//String filename="C-small-attempt0.in";
		String filename="C-large.in";
		String thisLine;
		try {
			BufferedReader br = new BufferedReader(new FileReader(filename));
			BufferedWriter bw= new BufferedWriter(new FileWriter(filename+".out"));
			thisLine=br.readLine();
			Integer tnum=Integer.parseInt(thisLine);
		     for(int i=0;i<tnum;i++) { // while loop begins here
		    	 	thisLine=br.readLine();
		           System.out.println(thisLine);
		           System.out.println("Case #"+(i+1)+": "+a.szamol(thisLine)+"\n");
		           bw.write("Case #"+(i+1)+": "+a.szamol(thisLine)+"\n");
		         } // end while 
		        // end try
		     br.close();
		     bw.close();
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}


	}

}

import java.io.*;
import java.util.*;
import java.util.regex.*;

import static java.lang.Math.*;

public class C {
	public static void main(String[] args) throws Exception {

		Scanner in = (args.length > 0) ? new Scanner(new File(args[0]))
				: new Scanner(System.in);
		int T = in.nextInt();
		for (int zz = 1; zz <= T; zz++) {
			System.err.format("#%d\n", zz);
			System.out.format("Case #%d: ", zz);

			int A = in.nextInt();
			int B = in.nextInt();
			int y = 0;

			Set<String> pairs = new HashSet<String>();

			int D = (int) Math.log10(A);
			long p0 = 10;
			long p1 = (long) Math.pow(10, D);

			for (int d = 1; d <= D; d++) {
				for (long n = A; n <= B; n++) {
					long m = ((n % p1) * p0) + (n / p1);
					if (m > n && m <= B && !pairs.contains(n + ":" + m)) {
						y++;
						pairs.add(n + ":" + m);
					}
				}
				p0 *= 10;
				p1 /= 10;
			}

			System.out.format("%d\n", y);
		}
	}
}
