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.util.Scanner;
import java.io.File;
import java.io.FileOutputStream;
import java.io.PrintStream;

public class Recycled {
  public static void main(String[] args) {
	try {
	  Scanner sc = new Scanner(new File("input.in"));
	  FileOutputStream output = new FileOutputStream("output.txt");
	  PrintStream p = new PrintStream(output);
	  int cases = Integer.parseInt(sc.nextLine());
	  for ( int i = 0; i < cases; i++ ) {
	    String aCase = sc.nextLine();
		int res = -1;
		int A = 0, B = 0;
		Scanner tmp = new Scanner(aCase);
		if(tmp.hasNextInt())
		  A = tmp.nextInt();
        if(tmp.hasNextInt())
		  B = tmp.nextInt();
		
        if(A >= B)
		  res = 0;		
		else
	      res = findRecycle(A,B);
		  
		int x = i+1;
        p.println("Case #" + x + ": " + res);		
	  }
	}
	catch(Exception e) {
	  e.printStackTrace();
	}
  }
  
   public static int findRecycle(int A, int B) {
     System.out.println("Find recycle " + A +", " + B);
     int count = 0;
	 for (int n = A; n < B; n++) {
	   for (int m = n + 1; m <= B; m++) {
	     if(isRecycled(Integer.toString(n), Integer.toString(m)))
		   count++;
		   //System.out.println(count);
	   }
	 }
	 return count;
   }
   
   public static boolean isRecycled(String n, String m) {
     int suffixes = n.length();
	 for (int i = 1; i < suffixes; i++) {
	   String tmp = n.substring(i);
       String toComp = tmp;
       for (int x = 0; x < i; x++) {
	     toComp += n.charAt(x);
       }	   
	   if(toComp.equals(m))
	     return true;	
	 }
     return false;
   }
  }