import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;


public class GoogleC {
	public String szamol(String input){
		String result="";
		String a=input;
		Integer min=Integer.parseInt(a.substring(0,a.indexOf(' ')));
		a=a.substring(a.indexOf(' ')+1);
		Integer max=Integer.parseInt(a);
		Long count=0l;
		for(Integer i=min; i<=max; i++){
			String e1=i.toString();
			Set<Integer> db=new HashSet<Integer>(); 
			for (int j=1; j<e1.length();j++){
				
				String e2=e1.substring(j)+e1.substring(0,j);
				Integer k=Integer.parseInt(e2);
				if (k>i && k<=max){
					db.add(k);
					//System.out.println(e1+"\t"+e2);
				}
				
			}
			count+=db.size();
		}
		
		return count.toString();
	}
	public static void main(String[] args) {
		GoogleC a=new GoogleC();
		//String filename="input.txt";
		//String filename="C-small-attempt0.in";
		String filename="C-large.in";
		String thisLine;
		try {
			BufferedReader br = new BufferedReader(new FileReader(filename));
			BufferedWriter bw= new BufferedWriter(new FileWriter(filename+".out"));
			thisLine=br.readLine();
			Integer tnum=Integer.parseInt(thisLine);
		     for(int i=0;i<tnum;i++) { // while loop begins here
		    	 	thisLine=br.readLine();
		           System.out.println(thisLine);
		           System.out.println("Case #"+(i+1)+": "+a.szamol(thisLine)+"\n");
		           bw.write("Case #"+(i+1)+": "+a.szamol(thisLine)+"\n");
		         } // end while 
		        // end try
		     br.close();
		     bw.close();
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}


	}

}

import java.io.*;
import java.lang.*;
import java.util.*;

public class Recycle{
   public static void main(String args []){
        try{
            FileInputStream fstream = new FileInputStream("C-large.in");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));

            FileWriter ostream = new FileWriter("recOut.txt");
            BufferedWriter out = new BufferedWriter(ostream);

            String str = br.readLine();
            int num = Integer.parseInt(str.replaceAll("\\s",""));

            String [] AB = new String[num];
            String temp;
            int k = 0;

            while((temp = br.readLine()) != null && k < num){
                AB[k] = temp;
                ++k;
            }

            //for(int i=1; i<= num; i++){
            for(int i=1; i<= num; i++){
                String ABs = AB[i-1].trim();
                int n = calcDig(ABs);
     
                out.write("Case #" + i + ": " + n);
                out.write("\n");
                out.flush();
            }
            out.close();
        }
        catch(Exception e){}
   }
   public static int calcDig(String input){
       String [] nums = input.split(" ");
       int A = Integer.parseInt(nums[0].replaceAll("\\s",""));
       int B = Integer.parseInt(nums[1].replaceAll("\\s",""));

       if(A < 10)
           return 0;
        else return numRot(A, B);     
   }

   public static int numRot(int A, int B){
       int toRet = 0;
       int len = Integer.toString(A).length();
       int cur = A;
       //System.out.println(A);
       //System.out.println(B);
       //System.out.println(len);

       HashMap<Integer, Integer> sets = new HashMap<Integer, Integer>();

       while(cur < B){
           for(int j=1; j< len; j++){         
               int newPerm = Rotate(cur, j, len);
               int newLen = Integer.toString(newPerm).length();
               //System.out.println(cur + " " +newPerm);
               if(B >= newPerm && newLen == len && cur < newPerm){
                   ++toRet;
                   //sets.put(cur, newPerm);
                   if(sets.containsKey(cur)){
                       if(sets.get(cur) == newPerm){
                           //System.out.println("Found: " + sets.get(cur));
                           --toRet;
                       }
                   }
                   else{
                    sets.put(cur, newPerm);
                   }
               }
               /*
               else
                   System.out.println("  perm " + newPerm + " not counted");
                   */
           }
           ++cur;
       }
       return toRet;
   }

   public static int checkRot(int A, int B, int len){
     //System.out.print("A: " + A);
     //System.out.println("B: " + B);

     List<Integer> aList = new ArrayList<Integer>();
     List<Integer> bList = new ArrayList<Integer>();

     int a = A;
     int b = B;

     while(a > 0){
         aList.add(a % 10);
         bList.add(b % 10);
         a /= 10;
         b /= 10;
      }
     
     Collections.sort(aList);
     Collections.sort(bList);

     if(aList.equals(bList)){
         //nreturn iterRot(A, B, len);
         return 0;
     }
     else
         return 0;
   }

   /*
   public static int iterRot(int A, int B, int len){
       int toRet = 0;
       for(int i=1; i<len; i++){
           if(Rotate(A, i, len) <= B)
               ++toRet;
       }
       return toRet;
    }*/

   public static int Rotate(int n, int k, int len){
       int rem = len-k;
       int place = (int)Math.pow(10,(rem));
       //System.out.println(place);
       int x = n/place;               
       //System.out.println(x);
       int y = n % place;
       //System.out.println(y);
       int newPlace = (int)Math.pow(10,k);

       return (y*newPlace) + x; 
   }
}

