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

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Map;

public class RecycledNumbersBig {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		Map<Integer, Integer> map = new HashMap<Integer, Integer>();
		int i;
		
		//System.out.println("size of map: " + map.size());
		try{
			
			FileInputStream fstream = new FileInputStream("/Users/mkay/Documents/input_31.txt");
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine;
			
			int input1, input2;
			String str1, str2;
			int count = 0,j,m,n,num;
			  while ((strLine = br.readLine()) != null)
			  {
				  //System.out.println (strLine);
				  
				  if(count != 0 )
				  {
					  map = new HashMap<Integer, Integer>();
					  input1 = Integer.parseInt(strLine.split(" ")[0]);
					  input2 = Integer.parseInt(strLine.split(" ")[1]);
					  num=0;
					  
					  for(i=input1;i<input2;i++)
					  {
						 if(i<=99){
							 j=i/10+(i%10)*10;
							 
							 if(j!=i && j>= input1 && j<= input2 && j <= 99 && j > i){
								 num++;
							 }
						 }else if(i<= 999){
							 j=i;
							 for(int k=0;k<2;k++){
								 j=j/10+(j%10)*100;
								 if(j>= input1 && j<= input2 && j!=i && j >= 100 && j>i)
									 num++;
							 }
						 }
						 else if(i<= 9999){
							 j=i;
							 map = new HashMap<Integer, Integer>();
							 for(int k=0;k<3;k++){
								 j=j/10+(j%10)*1000;
								 if(j>= input1 && j<= input2 && j!=i && j>i){
									 if(!map.containsKey(j)){
										 map.put(j, j);
										 num++;
									 }
									 //System.out.println(i + " : " + j);
									 
								 }
							 }
						 }
						 else if(i<= 99999){
							 j=i;
							 map = new HashMap<Integer, Integer>();
							 for(int k=0;k<4;k++){
								 j=j/10+(j%10)*10000;
								 if(j>= input1 && j<= input2 && j!=i && j>i)
									 if(!map.containsKey(j)){
										 map.put(j, j);
										 num++;
									 }
							 }
						 }
						 else if(i<= 999999){
							 j=i;
							 map = new HashMap<Integer, Integer>();
							 for(int k=0;k<5;k++){
								 j=j/10+(j%10)*100000;
								 if(j>= input1 && j<= input2 && j!=i && j>i)
									 if(!map.containsKey(j)){
										 map.put(j, j);
										 num++;
									 }
							 }
						 }
						 else if(i<= 999999){
							 j=i;
							 map = new HashMap<Integer, Integer>();
							 for(int k=0;k<6;k++){
								 j=j/10+(j%10)*1000000;
								 if(j>= input1 && j<= input2 && j!=i && j>i)
									 if(!map.containsKey(j)){
										 map.put(j, j);
										 num++;
									 }
							 }
						 }
						 else if(i<= 9999999){
							 j=i;
							 map = new HashMap<Integer, Integer>();
							 for(int k=0;k<7;k++){
								 j=j/10+(j%10)*10000000;
								 if(j>= input1 && j<= input2 && j!=i && j>i)
									 if(!map.containsKey(j)){
										 map.put(j, j);
										 num++;
									 }
							 }
						 }
					  }
					  //1761080
					  //999999
					  //for(Integer k: map.keySet())
						//  System.out.println(k + " : " + map.get(k));
					  //System.out.println("Case #"+ count + ": " + map.size() + " input: " + input1 + " : " + input2 + " num " + num);
					  System.out.println("Case #"+ count + ": " + num);
				  }
				  count++;
				  
			  }			  
			  in.close();
			}catch (IOException e)
		    {
				System.err.println("Error: " + e.getMessage());
		    }		
	}

}