/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

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

/**
 *
 * @author imgps
 */
public class C {
    public static void main(String args[]) throws Exception{
        int A,B;
        int ctr = 0;
        int testCases;
        
        Scanner sc = new Scanner(new FileInputStream("C-small-attempt0.in "));
        testCases = sc.nextInt();
        int input[][] = new int[testCases][2];
        for(int i=0;i<testCases;i++)
        {
          //  System.out.print("Enter input A B: ");
            input[i][0] = sc.nextInt();
            input[i][1] = sc.nextInt();
            
        }
  

for(int k=0;k<testCases;k++){
      ctr = 0;
      A = input[k][0];
      B = input[k][1];
        for(int i = A;i<=B;i++){
            int num = i;
            int nMul = 1;
            int mul = 1; 
            int tnum = num/10;
            while(tnum > 0){
                mul = mul *10;
                tnum= tnum/10;
            }
            tnum = num;
            int n = 0;
            while(tnum > 0 && mul >= 10){
                nMul = nMul * 10;
                n = (num % nMul) * mul + (num / nMul);
                mul = mul / 10;
                tnum = tnum / 10;
                for(int m=num;m<=B;m++){
                    
                    if(n == m && m > num){
                        ctr++;
                    }
                }
                
                
                
         
            }
        }
        System.out.println("Case #"+(k+1)+": "+ctr);
        
    }
    }
}

package CodeJam2012;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.StringTokenizer;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		FileReader in = new FileReader("C-small-attempt0.in");
		BufferedReader buff = new BufferedReader(in);
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter(
				"C-small-attempt0.out")));

		int nCases = Integer.parseInt(buff.readLine());
		StringBuilder output = new StringBuilder("");

		for (int i = 0; i < nCases; i++) {
			String input = buff.readLine();
			output.append("Case #" + (i + 1) + ": " + getPairs(input) + "\n");
		}
		out.print(output.toString());
		in.close();
		out.close();
	}

	private static long getPairs(String input) {
		StringTokenizer st = new StringTokenizer(input);
		String first = st.nextToken();
		String second = st.nextToken();
		int from = Integer.parseInt(first);
		int to = Integer.parseInt(second);
		long counter = 0;

		HashSet<String> set = new HashSet<String>();
		for (int i = from; i <= to; i++) {
			String temp = i + "";
			for (int j = 0; j < temp.length(); j++) {
				String next = temp.substring(j, temp.length())
						+ temp.substring(0, j);
				int x = Integer.parseInt(next);
				if (x <= to && x >= from && i < x
						&& !set.contains(temp + "$" + next)) {
					counter++;
					set.add(temp + "$" + next);
				}
			}
		}
		return counter;
	}
}
