/*
 * 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 main;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class QualificationC {

  public static void main(String[] args) throws IOException {
    
    String sampleIn = "input/c_sample.in";
    String sampleOut = "output/c_sample.out";
    
    String smallIn = "input/C-small-attempt1.in";
    String smallOut = "output/C-small-attempt1.out";
    
    String largeIn = "input/C-large.in";
    String largeOut = "output/C-large.out";
    
    String inFile = largeIn;
    String outFile = largeOut;
    
    FileWriter fstream = new FileWriter(outFile);
    BufferedWriter out = new BufferedWriter(fstream);
    
    int limit = 2000000;
    
    int ncase = 0;
    Map<Integer,Set<Integer>> map = mapGreaterRecycleds(limit);
    for (TestCase tc : loadTestCases(inFile)) {
      ncase++;
      long recycledsBetween = findPairsBetween(map, tc.a, tc.b);
      System.out.println("Case #" + ncase + ": " + recycledsBetween);
      out.write("Case #" + ncase + ": " + recycledsBetween + "\n");

    }
    out.close();
  }
  
  private static void test(int n, int limit) {
    for (int r : getGreaterRecycleds(n, limit)) {
      System.out.println(r);
    }
  }
  
  private static long findPairsBetween(Map<Integer,Set<Integer>> map, int a, int b) {
    long ret = 0;
    for (int i=a; i<b; i++) {
      for (int recycle : map.get(i)) {
        if (recycle <= b) {
          ret++;
        }
      }
    }
    return ret;
  }
  
  private static Map<Integer, Set<Integer>> mapGreaterRecycleds(int maxB) {
    Map<Integer, Set<Integer>> map = new HashMap<Integer,Set<Integer>>();
    for (int i = 1; i<maxB; i++) {
      map.put(i, getGreaterRecycleds(i, maxB));
    }
    return map;
  }
  
  private static Set<Integer> getGreaterRecycleds(int start, int maxB) {
    String s = Integer.toString(start);
    Set<Integer> ret = new TreeSet<Integer>();
    for (int firstChar = 1; firstChar < s.length(); firstChar++) {
      String rebuild = s.substring(firstChar) + s.substring(0, firstChar);
      if (!rebuild.startsWith("0")) {
        int recycled = Integer.parseInt(rebuild);
        if (recycled <= maxB && recycled > start) {
          ret.add(recycled);
        }
      }
    }
    return ret;
  }
  
  public static List<TestCase> loadTestCases(String filename){
    List<TestCase> cases = new LinkedList<TestCase>();
    try{
      BufferedReader reader = new BufferedReader(new FileReader(filename));
      String tString = reader.readLine();
      int t = Integer.parseInt(tString);
      for(int i=0; i<t; i++){
        StringTokenizer tokenizer = new StringTokenizer(reader.readLine());
        int a = Integer.parseInt(tokenizer.nextToken(" "));
        int b = Integer.parseInt(tokenizer.nextToken(" \n"));
        cases.add(new TestCase(a,b));
      }
    } catch(Exception e){
      e.printStackTrace();
      throw new RuntimeException("can't load " + filename + "!");
    }
    return cases;
  }
  
  private static class TestCase {
    public int a, b;
    public TestCase(int a, int b) {
      this.a = a;
      this.b = b;
    }
  }
  
}
