/*
 * 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 de.hg.codejam.tasks.numbers.service;

import java.util.HashSet;
import java.util.Set;

public class Calculator {

	private final Set<Integer> overallShifts = new HashSet<>();

	public int calculate(int[] pair) {
		int result = 0;

		int lowerBorder = pair[0];
		int upperBorder = pair[1];

		for (int i = lowerBorder; i <= upperBorder; i++) {
			if (!overallShifts.contains(i)) {
				Set<Integer> shifts = getShifts(i);

				int numberOfValidPairs = countValidPairs(shifts, lowerBorder,
						upperBorder);

				result += numberOfValidPairs;
			}
		}

		return result;
	}

	public static int[] calculate(int[][] pairs) {
		int[] results = new int[pairs.length];

		for (int i = 0; i < pairs.length; i++)
			results[i] = new Calculator().calculate(pairs[i]);

		return results;
	}

	private Set<Integer> getShifts(int number) {
		String n = String.valueOf(number);

		Set<Integer> result = new HashSet<>(n.length());
		result.add(number);

		for (int i = 1; i < n.length(); i++) {
			n = n.substring(n.length() - 1) + n.substring(0, n.length() - 1);

			result.add(Integer.parseInt(n));
		}

		overallShifts.addAll(result);

		return result;
	}

	private int countValidPairs(Set<Integer> numbers, int lowerBorder,
			int upperBorder) {
		int counter = 0;

		Integer[] array = new Integer[numbers.size()];
		numbers.toArray(array);

		for (int i = 0; i < array.length; i++)
			if (array[i] >= lowerBorder && array[i] <= upperBorder)
				for (int j = i + 1; j < array.length; j++)
					if (array[j] >= lowerBorder && array[j] <= upperBorder)
						if (array[i] != array[j]
								&& String.valueOf(array[i]).length() == String
										.valueOf(array[j]).length())
							counter++;

		return counter;
	}

}
