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.*;
   import java.io.*;
   public class Recycle
   {
      public static void main(String[] args)
      {
         try
         {
            Scanner scan = new Scanner(new File("Recycle.in"));
            int x = Integer.parseInt(scan.nextLine());
            for(int y=0;y<x;y++)
            {
               String s=scan.nextLine();
               calc(123,231,100);
               System.out.println("Case	 #"+(y+1)+": " + convert(s));
            }
         }
            catch(FileNotFoundException e)
            {
               System.out.println("File Not Found");
            }
      }
   
      public static int convert(String t)
      {
         int ret=0;
         String[] ar=t.split("[ ]");
         int a=Integer.parseInt(ar[0]);
         int b=Integer.parseInt(ar[1]);
         if(a == 0 && b == 0)
            return 0;
         if(b<a)
         {
            int c=a;
            a=b;
            b=a;
         }
         int max=1;
         while(max*10<=a)
            max*=10;
         for(int x=a;x<=b;x++)   
            for(int y=a;y<=b;y++)
               ret+=calc(x,y,max);
         return ret/2;
      }
   	
      public static int calc(int x,int y,int max)
      {
         for(int z=10;z<=max;z=z*10)
            if(x!=y) 
               if(x%z==(y-y%(max*10/z))*z/max/10)
                  if(y%(max*10/z)==(x-x%z)/z)
                     return 1;
         return 0;
      }
   }