import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

class RecycledNumbers{
	
	
	
	int getcount(int small,int large){
		int count = 0;
		for(int currnum = small; currnum < large; currnum++){
			int permut = currnum;
			int no_of_digits = 0;
			while(permut > 0){
				permut = permut/10;
				no_of_digits++;
			}
			int lastDigit = currnum % 10;
			permut = currnum / 10;
			permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
			while(permut != currnum){
				
				if(permut >= currnum && permut <= large){
					
					count++;
				}
				lastDigit = permut % 10;
				permut = permut / 10;
				permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
				
			}
			
		}
		
		return count;
	}
	
	public static void main(String args[]){
		RecycledNumbers d = new RecycledNumbers();
		
		int no_of_cases = 0;
		String input = "";
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		try{
			no_of_cases = Integer.parseInt(br.readLine());
		}
		catch(Exception e){
			System.out.println("First line is not a number");
		}
		
		for(int i=1; i <= no_of_cases;i++){
			try{
				input = br.readLine();
			}
			catch(Exception e){
				System.out.println("Number of test cases different from the number mentioned in first line");
			}
			
			System.out.print("Case #" +i+": ");
			
			StringTokenizer t =  new StringTokenizer(input);
			int small=0,large=0;
			if(t.hasMoreTokens()){
				small = Integer.parseInt(t.nextToken());
			}
			if(t.hasMoreTokens()){
				large = Integer.parseInt(t.nextToken());
			}
			System.out.println(d.getcount(small,large));
			
		}
		
		
		

	}
	
	
}
   import java.io.*;
   import java.util.*;

   public class Recycle
   {
      static int total;
		static Set<Integer> set;
      public static void main(String[] codejam) throws Exception
      {
         BufferedReader br = new BufferedReader (new FileReader ("recycle.in"));
         PrintStream ps = new PrintStream (new FileOutputStream ("recycle.out"));
         int t = Integer.parseInt(br.readLine());
         for(int l=1;l<=t;l++)
         {
            String[] in = br.readLine().split(" ");
            int first = Integer.parseInt(in[0]);
            int last = Integer.parseInt(in[1]);
            total = 0;
            for(int i=first;i<last;i++)
            {
               rotate(i, first, last);
            }
            ps.println("Case #" + l + ": " + total);
         
         }
      }
      public static void rotate(int m, int a, int b)
      {
			int q = 0;
         int n = m;
         String number = "" + m;
			set = new TreeSet<Integer>();
         for(int i=0;i<number.length()-1;i++)
         {
            String temp = number.substring(number.length()-1, number.length()) + number.substring(0, number.length()-1);
            m = Integer.parseInt(temp);
            if(("" + m).length() == number.length())
            {
               if(m <=b && m > a && m > n && !set.contains(m))
               {
						set.add(m);
                  total++;
               }
            }
            number = temp;
         }
      }
   }