/*
 * 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 jam.qualification;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;

public class RecycledNumbers {
	public static void main(String[] args) {
		try {
			BufferedReader in = new BufferedReader(new FileReader("file.in"));
			BufferedWriter out = new BufferedWriter(new FileWriter("file.out"));
			int n = Integer.parseInt(in.readLine());
			for (int i = 1; i <= n; ++i) {
				String[] ints = in.readLine().split(" ");
				char[] A = ints[0].toCharArray();
				char[] B = ints[1].toCharArray();
				
				int c = 0;
				try {
					c = count(A, B);
				}
				catch (Exception e) {
					System.err.println("Unexpected exception, I made a mistake...");
					e.printStackTrace();
					System.exit(1);
				}
				out.write("Case #" + i + ": " + c);
				if (i != n)
					out.newLine();
				out.flush();
			}
			out.close();
		}
		catch (Exception e) {
			System.err.println("Error occured while reading input!");
			e.printStackTrace();
			System.exit(1);
		}
	}
	
	private static int count(char[] A, char[] B) {
		char[][] buff = new char[A.length][A.length];
		int count = 0, ptr;
		do {
			ptr = 0;
			for (int n = 1; n < A.length; ++n) {
				swap(A, buff[ptr], n);
				if (compare(buff[ptr], A) > 0 && compare(buff[ptr], B) <= 0) {
					for (int i = 0; i < ptr; ++i)
						if (compare(buff[i], buff[ptr]) == 0) {
							--count;
							--ptr;
							break;
						}
					++count;
					++ptr;
				}
			}
			if (compare(A, B) >= 0)
				break;
			inc(A);
		} while (true);
		return count;
	}
	
	private static void swap(char[] src, char[] dst, int n) {
		System.arraycopy(src, 0, dst, n, src.length - n);
		System.arraycopy(src, src.length - n, dst, 0, n);
	}
	
	private static void inc(char[] N) {
		int i = N.length;
		while (N[--i] == '9')
			N[i] = '0';
		++N[i];
	}
	
	private static int compare(char[] X, char[] Y) {
		for (int i = 0; i < X.length; ++i)
			if (X[i] < Y[i])
				return -1;
			else if (X[i] > Y[i])
				return 1;
		return 0;
	}
}
