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;
	}
}
public class RecycledNumbers
{
   public static void main(String[] args)
   {
      java.util.Scanner console = new java.util.Scanner(System.in);

      int T = 0;
      int A = 0, B = 0;

      int numRecycledNumbers = 0;


      T = console.nextInt();
      console.nextLine();

      for (int i = 0; i < T; i++)
      {
         A = console.nextInt();
         B = console.nextInt();
         console.nextLine();

         // do stuff
         numRecycledNumbers = findRecycledNumbers(A, B);

         System.out.println("Case #" + (i + 1) + ": " + numRecycledNumbers);
      }      


      return;
   }


   private static int findRecycledNumbers(int A, int B)
   {
      int n = B;
      int magnitude= 0;
      int pairs = 0;
      boolean alreadySubtractedOne = false;

      String str_m = String.valueOf(A);
      String str_n = String.valueOf(B);

      String firstHalf = "";
      String secondHalf = "";

      // m = x.y * 10^magnitude
      // magnitude 1 less then number of digits
      magnitude = str_n.length() - 1; 


      // halfPower is used to retrieve the first half of m.
      int halfPower = 1;
      for (int i = 0; i < (magnitude + 1) / 2; i++)
         halfPower *= 10;


      for (int m = A; m <= B; m++)
      {
         str_m = String.valueOf(m);

         
         for (int j = magnitude ; j > 0; j--)
         {
            // Substring goes from start to end - 1, hence need to add 1
            // as 'magnitude' already has 1 subtracted from it.
            str_n = str_m.substring(j, magnitude + 1) + str_m.substring(0, j);


            n = Integer.parseInt(str_n);

            if ((n > m) && (n <= B))
            {
               // If m is of even length and first half matches second half
               // two duplicate entries can be generated, so subtract 1 from count
               // ie. xyz|xyZ => Zxyz|xy or z|xyZxy
               if (!alreadySubtractedOne &&
                  (((m % halfPower) * halfPower) == (m - (m % halfPower))))
               {
                  alreadySubtractedOne = true;
                  pairs--;
               }
               
               pairs++;
            }
         }
         
      }

      return pairs;
   }

}
