import java.io.*;

class code1
{
	public static void main(String args[]) throws Exception 
	{
		File ii = new File ("C-small-attempt1.in");
		FileInputStream fis = new FileInputStream(ii);
		BufferedReader  br = new BufferedReader(new InputStreamReader (fis));
		int cases = Integer.parseInt(br.readLine());
		FileOutputStream fout = new FileOutputStream ("output.txt");
		DataOutputStream dout = new DataOutputStream (fout);
		int total=0;
		for(int i=0;i<cases;i++){
		String temp = br.readLine();
		String parts [] = temp.split(" ");
		int lower = Integer.parseInt(parts[0]);
		int upper = Integer.parseInt(parts[1]);
		System.out.println(lower+" "+upper);
		
		for(int j=lower;j<=upper;j++)
		{
			int abc = j;int length=0;
			if(j<10)continue;
			while (abc!=0){abc/=10;length++;}
			abc=j;
			for(int m=0;m<length-1;m++){
				int shift = abc%10;
				abc=abc/10;
				System.out.println("hi "+j);
				abc=abc+shift*power(10,length-1);
				if(abc<=upper&&shift!=0&&abc>j)total++;
				System.out.println(total);
			}
		}
 		dout.writeBytes("Case #"+(i+1)+ ": "+total+"\n");
 		total=0;
		}//for close
		
	}

	private static int power(int i, int j) {
		int no=1;
		for(int a=0;a<j;a++){no=10*no;}
		return no;
	}
}
import java.io.File;
import java.io.IOException;
import java.util.LinkedList;
import java.util.List;
import java.util.Scanner;


public class QuestionC {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		File fileread = new File("C-small-attempt0.in.txt");
		File filewrite = new File(QuestionC.class.getName() + "output.txt");
		GCIFileReader fr = new GCIFileReader(fileread);
		GCIFileWriter fw = new GCIFileWriter(filewrite);
		GCIResult res = new GCIResult();
		String s = fr.getLine();
		int n = Integer.parseInt(s);
		List<Integer> m = new LinkedList<Integer>();
		for (int i=0; i < n ; i++)
		{
			String l = fr.getLine();
			Scanner sc = new Scanner(l);
			int tres = 0;
			int tn = 0;
			int tm = 0;
			int newnum = 0;
			int A = sc.nextInt();
			int B = sc.nextInt();
			int length = Integer.toString(A).length();
			length--;
			for(int j=A ; j <= B ; j++)
			{
				int tlength = length;
				m.clear();
				while(tlength>0)
				{
					tn = (int) (j % (Math.pow(10,tlength)));
					tm = (int) (j / (Math.pow(10,tlength)));
					newnum = (int) (tn*(Math.pow(10, Integer.toString(tm).length())) + tm);
					if (!m.contains(newnum) &&newnum <= B  && j < newnum && Integer.toString(tn).length() == tlength && Integer.toString(tm).length() == (length+1 - tlength))
					if (newnum <= B && tn!=0 && j < newnum)
					{
						tres++;
						m.add(newnum);
					}
					tlength--;
				}
			}
			res.addCase(String.valueOf(tres));
		}
		fw.writeResult(res);
	}

}
