/*
 * 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");
    }

}
package info.zhenhua.codejam;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;

abstract class RecycledNumbersSolver {
  protected String inputFileName;
  String outputFileName = null;
  PrintStream ps = null;
  
  public final static String smallInput = "-small-practice.in";
  public final static String bigInput = "-large-practice.in";
  public final static String smallOutput = "-small-practice.out";
  public final static String bigOutput = "-large-practice.out";
  
  public final static String smallContestInput = "-small-attempt0.in";
  public final static String bigContestInput = "-large.in";
  public final static String smallContestOutput = "-small-attempt0.out";
  public final static String bigContestOutput = "-large.out";
  
  protected String fileNamePrefix = null;
  
  public RecycledNumbersSolver(String inputFileName, String outputFileName, String fileNamePrefix) {
    this.inputFileName = inputFileName;
    this.outputFileName = outputFileName;
    this.fileNamePrefix = fileNamePrefix;
  }
  
  
  public String getInputFileName() {
    return fileNamePrefix + inputFileName;
  }

  public void setInputFileName(String inputFileName) {
    this.inputFileName = inputFileName;
  }

  public String getOutputFileName() {
    return fileNamePrefix + outputFileName;
  }

  public void setOutputFileName(String outputFileName) {
    this.outputFileName = outputFileName;
  }

  abstract protected void solveAll() throws IOException;

  protected void printOutput (String result) throws FileNotFoundException {
    if (ps == null) {
      if (this.getOutputFileName() == null)
        ps = new PrintStream(System.out);
      else
        ps = new PrintStream(this.getOutputFileName());
    }
    ps.println(result);
  }
}
/**
 * @author zhguo
 * 
 */
public class RecycledNumbers extends RecycledNumbersSolver {

  public RecycledNumbers(String inputFileName, String outputFileName) {
    super(inputFileName, outputFileName, "C");
  }

  /**
   * @param args
   * @throws IOException
   */
  public static void main(String[] args) throws IOException {
    RecycledNumbers recycledNumbers = new RecycledNumbers(bigContestInput,
        bigContestOutput);
    recycledNumbers.solveAll();
  }

  @Override
  protected void solveAll() throws IOException {
    BufferedReader br = new BufferedReader(new FileReader(getInputFileName()));
    String line = br.readLine();
    int testcases = Integer.valueOf(line);
    for (int j = 1; j <= testcases; ++j) {
      line = br.readLine();
      String[] parts = line.split(" ");
      int min = Integer.valueOf(parts[0]);
      int max = Integer.valueOf(parts[1]);
      
      long result = solveOneTestCase(min, max);
      printOutput("Case #" + j + ": " + result);
    }
    br.close();
    if (ps != null)
      ps.close();
  }

  static final int MAX = 2000000;
  Set<Integer> visited = new HashSet<Integer>();
  
  private long solveOneTestCase(int min, int max) {
    StringBuilder sb = new StringBuilder();
    long nums = 0;
    for (int i = min; i <= max; ++i) {
      visited.clear();
      sb.replace(0, sb.length(), String.format("%d%d", i, i));
      int len = sb.length() / 2;
      for (int j = 1; j < len; ++j) {
        int num = Integer.valueOf(sb.substring(j, j + len));
        if (num > max || num <= i || visited.contains(num)) continue;
        visited.add(num);
        ++nums;
      }
    }
    return nums;
  }
}
