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

import java.io.File;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Scanner;

/**
 *
 * @author daniele
 */
public class GCJ_C {
    
    public static void main(String[] args) throws Exception{
        
        
        
        Scanner in = new Scanner(new File(args[0]));
        FileWriter out = new FileWriter("/home/daniele/Scrivania/Output");
        

        int prove=in.nextInt();
        int min,max;
        int cifre;
        int cifreaus;
        String temp;
        int aus;
        int count=0;
        ArrayList<Integer> vals = new ArrayList<Integer>();
        int jcount=0;
        ArrayList<Integer> perm = new ArrayList<Integer>();
        
        out.write("");
        out.flush();
        
        for(int i=1;i<=prove;i++){
            
            out.append("Case #" +i+": ");out.flush();
            
            min=in.nextInt();
            max=in.nextInt();
            
            for(int j=min;j<=max;j++){
               if(!vals.contains(j)){
                    temp=""+j;
                    cifre=temp.length();
                    aus=j;
                    perm.add(j);
                    for(int k=1;k<cifre;k++){
                        aus=rotateOnce(aus);
                        temp=""+aus;
                        cifreaus=temp.length();//elusione zeri iniziali
                        if(aus>=min && aus<=max && aus!=j && cifreaus==cifre && nobody(vals,perm)){ 
                            perm.add(aus);
                            jcount ++;
                            
                        }
                        
                    }
                    while(jcount>0){count+=jcount; jcount--;}
                    vals.addAll(perm);
                    perm= new ArrayList<Integer>();
                    
                }
            }
            out.append(count+"\n");out.flush();
            count=0;
            vals= new ArrayList<Integer>();
        }
        
        
        
    }
        static public int rotateOnce(int n){
            String s=""+n;
            if(s.length()>1){
                s=s.charAt(s.length()-1) + s.substring(0,s.length()-1);
                n=Integer.parseInt(s);
            }
            return n;
        }    
        
        static public boolean nobody(ArrayList<Integer> v,ArrayList<Integer> a){;
            for(int i=0;i<a.size();i++)
                if(v.contains(a.get(i))) return false;
            return true;
        } 
    
}


import java.io.*;
import java.lang.*;
import java.lang.StringBuilder;
import java.util.Arrays;
import java.lang.Integer;
//import org.apache.commons.lang.ArrayUtils;

class Recycle 
{

 public static void circularShiftLeft(char[] arr) {
        if (arr.length == 0)
            return;

        char first = arr[0];
        System.arraycopy(arr, 1, arr, 0, arr.length - 1);
        arr[arr.length - 1] = first;
		
		
    }
	
	
 public static void main(String args[])
 {
 
		/*int[] arr = { 1, 2, 3, 4 };
        System.out.println(Arrays.toString(arr));
        circularShiftLeft(arr);
        System.out.println(Arrays.toString(arr));*/
	try
  {	
  String[] toCompare;
  
  FileWriter ostream = new FileWriter("C-small-attempt0.out");
  BufferedWriter out = new BufferedWriter(ostream);
  
  FileInputStream fstream = new FileInputStream("C-small-attempt0.in");
  
  DataInputStream in = new DataInputStream(fstream);
  BufferedReader br = new BufferedReader(new InputStreamReader(in));
  String strLine;
  int count=0;
  int resultcounter = 0;
  //StringBuilder result = new StringBuilder();
  strLine = br.readLine();
  strLine = br.readLine();
  
  do{
		//toConvert = strLine.toCharArray();
		//toCompare="";
		
		StringBuilder result = new StringBuilder();
	count++;
	result.append("Case #"+count+": ");
	
		toCompare = strLine.split(" ");
		//System.out.println(toCompare.length);
	    resultcounter = 0;
		int n =  Integer.parseInt(toCompare[0]);
		int m =  Integer.parseInt(toCompare[1]);
		
		/*char [] n1 = toCompare[0].toCharArray();
		char [] m1 = toCompare[1].toCharArray();*/
		
		char [] n1;
		char [] m1; 
				//System.out.println(n+ " : "+Arrays.toString(n1));
			    //System.out.println(m+ " : "+Arrays.toString(m1));
				
		for(;n<m-1;n++)
		{
			int m2=m;
			for(;m2>n+1;m2--)
			{
					n1 = (new Integer(n)).toString().toCharArray();
					m1 = (new Integer(m2)).toString().toCharArray();
					
					for(int index=0; index<m1.length; index++)
					{
						String nn = new String(n1);
						String mm = new String(m1);
						//System.out.println("Compare : "+ nn + " -- "+mm);
						if(nn.equals(mm))
						{
								System.out.print(nn + " : " +mm+"\t");
								resultcounter++;
						}
						circularShiftLeft(n1);
					}					
					/*System.out.println("n,m : " + n + " : "+m2+ " : "+Arrays.toString(n1)+" Length: "+n1.length);
					circularShiftLeft(n1);
					System.out.println(Arrays.toString(n1));*/
			}
		}
		System.out.println("---------------------------------- " + resultcounter);
		//System.out.println("n - m" + n + m);
		
		
	result.append(resultcounter);
	out.write(result.toString());
	out.newLine();
 
  }while ((strLine = br.readLine()) != null);
out.close();
  in.close();
  }
  catch(Exception e)
  {
  System.err.println("Error: " + e.getMessage());
  }
  
}

}

