/*
 * 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.*;
import java.util.Scanner;
public class RecycledNumbers{
  
  public static void main(String[] args){
    
    //read filename from user
    Scanner request = new Scanner(System.in);
    System.out.println("Enter file name");
    String fileName = request.nextLine();
    
    
    try{
    //create a filereader to read through file contents
      
    Scanner inputFile = new Scanner(new File(fileName));
    //create output file
    BufferedWriter outputFile = new BufferedWriter(new FileWriter("output.txt"));
    
    //read file contents
    
    int lineCount = inputFile.nextInt();
    for(int i=0; i<lineCount;i++){
      int totalCount = 0;
      int a = inputFile.nextInt();
      int b = inputFile.nextInt();
      for(int x=a;x<=b;x++){
      totalCount += recycle(x,b);
      }
      //System.out.println("------------------>"+totalCount);
      outputFile.write("Case #"+ (i+1) + ": " +totalCount);
      outputFile.newLine();
      
    }
   outputFile.close();
    }
    catch(IOException e){
      System.out.println("Error getting file");
    }
  }//end of main
  
  public static int recycle(int base, int max){
    
    String num = base+"";
    int length = num.length();
    //System.out.println(num + " "+length);
    int loop = length-1;
    String front="";
    String back="";
    int result=0;
    int correct=0;
    int current=-99;
    
    for(int i=0; i<=loop; i++){
      
      front = num.substring(0,loop-i);
      back = num.substring(loop-i);
      String res=back+front;
      
      result = Integer.parseInt(res);
      //System.out.println(result);
      
      if((result!=current) && (result > base) && (result <=max)){
        
        current = result;
        correct++;
      }
    }
    return correct;
  }//end of recycle
  
}//end of class