import java.util.*;
import java.io.*;

public class recycled_numbers {
	public static void main(String[]a) throws Exception{
		
		Scanner f = new Scanner(new File(a[0]));
		int result=0;
		int A,B;
		String n,m;
		HashSet<String> s=new HashSet<String>();
		
		int T=f.nextInt();	//T total case count
		for (int t=1; t<=T;t++){//for each case t
			
			s.clear();
			result=0;				//reset
			A=f.nextInt();B=f.nextInt();	//get values for next case
			
			if (A==B)result=0;//remove case not meeting problem limits 
			else{
				for(int i=A;i<=B;i++){//for each int in range
					n=Integer.toString(i);
					m=new String(n);
					//System.out.println(n);
					for (int j=1;j<n.length();j++){//move each digit to the front & test
						m = m.substring(m.length()-1)+m.substring(0,m.length()-1);
						if(m.matches("^0+[\\d]+")!=true &&
								Integer.parseInt(m)<=B &&
								Integer.parseInt(n)<Integer.parseInt(m)){
							s.add(new String(n+","+m));
							//result++;
							//System.out.println(" matched: "+m);
						}
						
					}
				}
				result = s.size();
			}

			//display output
			System.out.println("Case #" + t + ": " + result);
		}
	}
}
package com.unitedcoders.examples.codejam;

import java.io.File;
import java.io.PrintStream;
import java.util.Scanner;

public class RecycledNumbers {

    public static void main(String[] args) throws Exception {

        Scanner scanner = new Scanner(new File("/Users/nh/c.in"));
        PrintStream out = new PrintStream(new File("/Users/nh/c.out"));


        int testcases = scanner.nextInt();
        scanner.nextLine();
        for (int casenr = 1; casenr <= testcases; casenr++) {

            int a = scanner.nextInt();
            int b = scanner.nextInt();

            int p = solve(a, b);

            System.out.printf("Case #%d: %d\n", casenr, p);
            out.printf("Case #%d: %d\n", casenr, p);
        }
    }

    public static int solve(int a, int b) {

        int result = 0;

        String sA = intToString(a);
        String sB = intToString(b);

        for (int i = a; i <= b; i++) {
            if (i < 10) {
                continue;
            }

            String k = intToString(i);
            for (int j = 0; j < sA.length()-1; j++) {
                k = cycle(k);

                if((stringToInt(k)>i) && (stringToInt(k)<=b)){
                    result++;
                }

            }
        }

        return result;

    }

    public static String intToString(int i) {
        StringBuffer sb = new StringBuffer();
        while (i > 0) {
            sb.append(i % 10);
            i = i / 10;
        }

        return sb.reverse().toString();
    }

    public static int stringToInt(String s) {

        return Integer.valueOf(s);
    }

    public static String cycle(String s) {
        StringBuffer sb = new StringBuffer();
        for (int i = 1; i < s.length(); i++) {
            sb.append(s.substring(i, i + 1));
        }
        sb.append(s.substring(0, 1));
        return sb.toString();

    }


}
