/*
 * 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 ProbC
{
	String calculate(int low,int up)
	{	String ans="";
		int anscount=0;
		int l=low;
		int u=up;
		for(int i=l;i<=u;i++)
		{
				String num=Integer.toString(i);
				for(int j=1;j<num.length();j++)
				{
					String first=num.substring(0,j);
					String second=num.substring(j,num.length());
					String now=second+first;
					//System.out.println(now);
					if(now.charAt(0)=='0')
					{
						
					}
					else
					{
						int comp=Integer.parseInt(now);
						if(comp<=up&&i<comp)
						{
							anscount=anscount+1;
						}
					}
			}
		}
	
				return Integer.toString(anscount);
	}

	public static void main(String args[]) 
	throws IOException 
	{
		ProbC obj=new ProbC();
		
		File ii = new File ("C-large.in");
		FileInputStream fis = new FileInputStream(ii);
		BufferedReader  br = new BufferedReader(new InputStreamReader (fis));
		int cases = Integer.parseInt(br.readLine());
		FileOutputStream fout = new FileOutputStream ("ProbCoutputlarge.txt");
		DataOutputStream dout = new DataOutputStream (fout);
		
		for(int i=0;i<cases;i++)
		{
			String temp1 = br.readLine();
			String parts [] = temp1.split(" ");
			
			int low=Integer.parseInt(parts[0]);
			int up=Integer.parseInt(parts[1]);
			int uc=0,lc=0;
			int temp=low;
			while(temp>0)
			{
				int a=temp%10;
				temp=temp/10;
				uc++;
			}
			temp=low;
			while(temp>0)
			{
				int a=temp%10;
				temp=temp/10;
				lc++;
			}
			if(uc==lc)
			{
				System.out.println("A and B have same number of digits");
				String result=obj.calculate(low,up);
				String finalans="Case #"+(i+1)+":  "+result+System.getProperty("line.separator");
				dout.writeBytes(finalans);
			}
			else
			{
				System.out.println("A and B do not have same number of digits");
			}
		
		}
	}
}