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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
import java.util.Map.Entry;

public class RecycledNumbers {

	
	public static void main(String[] args) throws IOException {
		InputScanner1 in = new InputScanner1(new File("C-large.in"));//C-small-attempt0.in
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("C-large.out")));
		
		int t = in.nextInt();
		for (int i = 1; i <= t; i++) {
			
			HashSet<String> set = new HashSet<String>();
			int a = in.nextInt();
			int b = in.nextInt();
			
			for (int n = a; n <= b ; n++) {
				
				String number = ""+n;
				int len = Integer.toString(n).length();
				
				for (int j = 1; j < len ; j++) {
					String temp = number.substring(j) + number.substring(0, j);
					
					int k = Integer.valueOf(temp);
					if( k<=b && n<k && number.length() == Integer.toString(k).length()){
						
						
						set.add(number+" "+k);
					}
				}
				
			}
			
			int result = set.size();
			out.println("Case #"+i+": "+result);
		}
		
	
		out.close();
	}


}


class InputScanner1 {
	BufferedReader br;
	StringTokenizer strtok = null;

	public InputScanner1(InputStream stream) {
		br = new BufferedReader(new InputStreamReader(stream));

	}

	public InputScanner1(File file) throws FileNotFoundException {
		br = new BufferedReader(new FileReader(file));
	}

	public String next() {
		if (strtok == null || !strtok.hasMoreTokens()) {
			try {
				strtok = new StringTokenizer(br.readLine());
			} catch (IOException e) {
				throw new RuntimeException(e);
			}
		}
		return strtok.nextToken();
	}

	public int nextInt() {
		int i;
		try {
			i = Integer.parseInt(next());
		} catch (NumberFormatException e) {
			throw new RuntimeException(e);
		}
		return i;
	}

	public String nextLine() {
		if (strtok == null || !strtok.hasMoreTokens()) {
			try {
				strtok = new StringTokenizer(br.readLine());
			} catch (IOException e) {
				throw new RuntimeException(e);
			}
		}
		return strtok.nextToken("\n").trim();
	}

}