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

package Happy;
import java.io.*;
import java.math.*;
import java.lang.*;
import java.util.*;
import java.util.Arrays.*;
import java.io.BufferedReader;
//import java.io.IOException;
//import java.io.InputStreamReader;
//import java.io.PrintWriter;
//import java.util.StringTokenizer;

/**
 *
 * @author ipoqi
 */
public class Happy {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        new Happy().haha();
    }

    public void haha() {
        BufferedReader in = null;
        BufferedWriter out = null;
        try{
            in = new BufferedReader(new FileReader("C-large.in"));
            out = new BufferedWriter(new FileWriter("LLL.out"));
            int T = Integer.parseInt(in.readLine());
            System.out.println("T="+T);

            //LinkedList<Integer> mm = new LinkedList<Integer>();
            //mm.add(new LinkedList<Integer>());
           //int[][] mm;
           //for(int ii=0;ii<mm.length;ii++){
           //     mm[0][ii] = 1;
           //}


            for(int i=0;i<T;i++){
                String[] line = in.readLine().split(" ");
                int A = Integer.parseInt(line[0]);
                int B = Integer.parseInt(line[1]);
                //System.out.print(" A = "+A+"\n");
                //System.out.print(" B = "+B+"\n");

                int ans = 0;

                
                for(int j=A;j<B;j++){
                    int n=j;
                    if(n>=10){
                        String N = Integer.toString(n);
                        int nlen = N.length();
                        List<Integer> oks = new ArrayList<Integer>();
                        for(int k=0;k<nlen-1;k++){
                            String M = "";
                            for(int kk=1;kk<=nlen;kk++){
                                 M = M + N.charAt((k+kk)%nlen);
                            }
                            int m = Integer.parseInt(M);
                            //System.out.print(" N = "+N+"\n");
                            //System.out.print(" M = "+M+"\n");

                            if(m>n && m<=B) {
                                boolean isNewOne = true;
                                for(int kkk=0;kkk<oks.size();kkk++){
                                    //System.out.print(" KKK = "+oks.get(kkk)+"\n");
                                    if(m==oks.get(kkk)){
                                        isNewOne = false;
                                    }
                                }
                                if(isNewOne){
                                    //System.out.print(" N = "+N+"\n");
                                    //System.out.print(" M = "+M+"\n");
                                    oks.add(m);
                                    ans++;
                                }
                            }
                        }
                    }
                }
                out.write("Case #"+(i+1)+": "+ans+"\n");
                System.out.print("Case #"+(i+1)+": "+ans+"\n");
            }
            in.close();
            out.close();
        }catch(Exception e){
            e.printStackTrace();
            try{
                in.close();
                out.close();
            }catch(Exception e1){
                e1.printStackTrace();
            }
        }
        System.out.print("YES!\n");
    }

}
import java.io.*;

class RecycledNumbers
{
	static int A,B,result;
	public static void main(String args[]) throws IOException
	{
		FileInputStream fstream = new FileInputStream("C-large.in");
		DataInputStream dstream = new DataInputStream(fstream);
		BufferedReader br = new BufferedReader(new InputStreamReader(dstream));
		FileWriter fw = new FileWriter("output.txt");
		BufferedWriter out = new BufferedWriter(fw);
		
		int lines = Integer.parseInt(br.readLine());		//lines LINES OF INPUT TO FOLLOW
		
		for(int j=0;j<lines;j++)                        //EACH LINE FROM SECOND LINE
		{
			result=0;
		
			out.write("Case #"+(j+1)+": ");
		
			
			
			String str = br.readLine();
			String strAray[] = str.split(" ");
			A = Integer.parseInt(strAray[0]);
			B = Integer.parseInt(strAray[1]);
			
			for(int i=B;i>A;i--)
			{
				result = result+howMany(i);
				
				
			}
			
			out.write(Integer.toString(result));// write result
			out.newLine();
		}		
		fstream.close();
		out.close();
		//log.close();
	}
	static int howMany(int m) throws IOException
	{	
		int n,no=0;
		
		int length = (Integer.toString(m)).length();
		if(length==1)
		{
		
			return 0;
		}
		
		for(int i=1;i<length;i++)
		{
			n=rotate(i,m,length);
					
			if(A<=n && n<m && m<=B)
				no++;
		}
		
		return no;
	}
	static int rotate(int j, int m, int length) throws IOException
	{
		
		
	
		
		
		String s = Integer.toString(m);
		int[] intArray = new int[length];
		int number = 0;
	
 
		for (int i = 0; i < length; i++)
		{
			intArray[i] = Character.digit(s.charAt(i), 10);
		}
		for(int i=0;i<j;i++)					//rotate m , i times
		{
			int temp = intArray[0];
			for(int k=0;k<(length-1);k++)
			{
				intArray[k] = intArray[k+1];
			}
			intArray[length-1] = temp;
		}
		for(int i=0;i<length;i++)
		{
			number = number*10 + intArray[i];
		}
		
		return number;
	}
	
	
}