/*
 * 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.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;
import java.util.Stack;



public class RecycledNum {

	
	public static void main(String[] args) throws IOException
	{
		File file = new File("C-small-attempt0.in");
		Scanner scanner;
		BufferedWriter out = new BufferedWriter(new FileWriter("outfile1"));
		
		try
		{
			scanner = new Scanner(file);
			int testCases = scanner.nextInt();
			scanner.nextLine();  
			
			for(int numTest=0; numTest<testCases; numTest++)
			{
				int A = scanner.nextInt();
				int B = scanner.nextInt();
				scanner.nextLine();
				int totalcount=0;
				
				Stack<Integer> st = new Stack<Integer>();
				int numDigit =0;
				int temp = A;
				while(temp != 0)
				{
					st.push(temp%10);
					numDigit++;
					temp=temp/10;	
				}
				int[] digitsA = new int[numDigit];
				for(int i=0; i<numDigit; i++)
					digitsA[i]= st.pop();
				int[] digitsB = new int[numDigit];
				temp=B;
				int index=numDigit;
				while(temp != 0)
				{
					digitsB[index-1]=(temp%10);
					index--;
					temp=temp/10;	
				}
				
				
				
				int numofInt = B-A+1;
				boolean[] mark = new boolean[numofInt];
			
				
				for(int num=A; num<=B; num++)
				{
				
					int[] curDigits = new int[numDigit];
					temp = num;
				    index=numDigit;
					while(temp!=0)
					{
						curDigits[index-1]=(temp%10);
						index--;
						temp=temp/10;	
					}
					int count = 0;
					for(int j=0; j<numDigit; j++)
					{
						boolean cycle = false;
						if(curDigits[j]!=0)
						{
							int sum=0;
							int curindex=j;
							for(int kk=0; kk<numDigit; kk++)
							{
						
					
								if(curindex>=numDigit)
								
									sum=sum*10+curDigits[curindex-numDigit];
								else
									sum=sum*10+curDigits[curindex];
								curindex=curindex+1;
								
							}
				
							if((sum<=B)&&(sum>=A))
								cycle=true;
							
							
							
							if(cycle==true)
							{
								
							
								
								if(mark[sum-A]!= true)
								{
									mark[sum-A]= true;
									count++;
				
								}	
							}
							
						}
					}
					
					if(count==7)
						totalcount=totalcount+21;
					else if(count==6)
						totalcount=totalcount+15;
					else if(count==5)
						totalcount=totalcount+10;
					else if(count==4)
						totalcount=totalcount+6;
					else if(count==3)
						totalcount=totalcount+count;
					else if(count==2)
						totalcount=totalcount+1;
					
				}
				
				
				
				out.write("Case #"+(numTest+1)+": "+ totalcount +"\n");
				
			}
			out.close();
		}
		catch (FileNotFoundException e) {
			e.printStackTrace();
		}

	}
}
