/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package recyclednumbers;

import java.util.HashSet;

/**
 *
 * @author vandit
 */
public class RecycleNumbers {

    private HashSet<String> numbers = new HashSet<String>();
    private HashSet<String> initialTempNumbers = new HashSet<String>();
    private HashSet<String> finalTempNumbers = new HashSet<String>();

    HashSet<Pair> numberPairs = new HashSet<Pair>();


    private void findRecycledNumbers(int start, int end, int places) {


        for (int i = start; i <= end; i++) {
            String initialNumber = Integer.toString(i);
            //if (!(numbers.contains(initialNumber) || finalTempNumbers.contains(initialNumber))) {

                StringBuffer tempNumber = new StringBuffer(initialNumber);
                int len = tempNumber.length();
                int startIndexToMove = len - places;
                String tempString = tempNumber.substring(startIndexToMove);
                if ((places == 1 && tempString.equals("0")) || tempString.charAt(0) == '0') {
                    continue;
                }
                tempNumber.delete(startIndexToMove, len);
                String finalTempNumber = tempString + tempNumber.toString();

                if (! (finalTempNumber.equals(initialNumber) || Integer.parseInt(finalTempNumber) > end || Integer.parseInt(finalTempNumber) < Integer.parseInt(initialNumber))) {
                    numbers.add(initialNumber);
                    finalTempNumbers.add(finalTempNumber);
                    Pair pair = new Pair(finalTempNumber,initialNumber);
                    numberPairs.add(pair);
                }
            }

        

    }

    public HashSet<Pair> findAllRecycledNumbers(int start, int end) {
        int length = Integer.toString(start).length();
        for (int i = 1; i < length; i++) {
            findRecycledNumbers(start, end, i);
        }
        return numberPairs;
    }
}

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.StringTokenizer;


public class Problem3 {
	public static void main(String[] args) throws Exception {
		  BufferedReader br = new BufferedReader(new FileReader(new File("C-small-attempt0.in")));
		  PrintWriter pw = new PrintWriter(new File("C-small-attempt0.out"));
		  int a,b ,count, m, digitscount;
		  int t= new Integer(br.readLine());
		  for(int c=1; c<=t; c++)
		  {
		   pw.append("Case #"+c+": ");
		   StringTokenizer st = new StringTokenizer(br.readLine());
		   a = new Integer(st.nextToken());
		   b= new Integer(st.nextToken());
		   
		   count=0; 
		   for (int n =a; n<b ; n++)
		   {
			   digitscount =1;
			   for(int i=n; i>0 ; i/=10)
				   digitscount*=10;
			   
			   HashSet<Integer> set = new HashSet<Integer>();
			   for(int i=10; i< n; i*=10)
			   {
				   m = n/i+ n%i*(digitscount)/i;
				   
				   //System.out.println(m);
				   if(m>n && m<=b && !set.contains(m))
				   {
					   set.add(m);
					   count++;
					  // System.out.println(n+" "+m);
				   }
			   }
			   
		   }
		   
		   pw.append(count+"");
		   pw.append('\n');
		  }
		  pw.flush();
		  pw.close();
		  br.close();
		 }
}
