/*
 * 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 google.codejam2012.awanish;

import java.util.ArrayList;
import java.util.Scanner;
import java.util.StringTokenizer;

public class RecycledNumbers {
	static long total = 0;

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub

		Scanner inputScan = new Scanner(System.in);
		int noOfCases = Integer.parseInt(inputScan.nextLine());
		long start;
		long end;
		for (int i = 1; i <= noOfCases; i++) {
			total = 0;

			String startend = inputScan.nextLine();
			StringTokenizer st = new StringTokenizer(startend, " ");
			start = Integer.parseInt(st.nextToken());
			end = Integer.parseInt(st.nextToken());
			for (long j = start; j <= end; j++) {
				checkPair(j, start, end);
			}
			System.out.println("Case #" + i + ": " + total/2);

		}

	}

	private static void checkPair(long j, long start, long end) {

		ArrayList a = new ArrayList();
		String tocheck = String.valueOf(j);
		a.add(tocheck);
		for (int c = 0; c < tocheck.length(); c++) {
			tocheck = rotate(tocheck);
			if (!a.contains(tocheck) && !tocheck.substring(0, 1).equals("0")
					&& start <= Integer.parseInt(tocheck)
					&& Integer.parseInt(tocheck) <= end) {
				a.add(tocheck);
				total++;
			}
		}

	}

	private static String rotate(String tocheck) {
		// TODO Auto-generated method stub
		return tocheck.substring(tocheck.length() - 1, tocheck.length())
				+ tocheck.substring(0, tocheck.length() - 1);
	}
}
