package qual;

import java.util.Scanner;

public class RecycledNumbers {

	public static void main(String[] args) {
		new RecycledNumbers().run();

	}

	private void run() {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int t = 0; t < T; t++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			int result = solve(A, B);
			System.out.printf("Case #%d: %d\n", t + 1, result);
		}
	}

	public int solve(int A, int B) {
		int result = 0;
		for (int i = A; i <= B; i++) {
			int dig = (int) Math.log10(A/*same as B*/) + 1;
			int aa = i;
			for (int d = 0; d < dig - 1; d++) {
				aa = (aa % 10) * (int)Math.pow(10, dig - 1) + (aa / 10);
				if (i == aa) {
					break;
				}
				if (i < aa && aa <= B) {
//					System.out.printf("(%d, %d) ", i, aa);
					result++;
				}
			}
		}
		return result;
	}

}

package com.google.codejam.practice2012.qualificationRound;

import com.google.codejam.abs.Problem;
import com.google.codejam.utils.files.ManejoArchivos;

import java.io.FileNotFoundException;
import java.io.IOException;

import java.util.HashMap;
import java.util.Map;

public class RecycledNumbers extends Problem {
    public RecycledNumbers(String name) throws FileNotFoundException, 
                                               IOException {
        super(name);
    }

    public static void main(String[] args) throws FileNotFoundException, 
                                                  IOException {
        //new RecycledNumbers("RecycledNumbers-Sample");
        new RecycledNumbers("RecycledNumbers-Small");
        //new RecycledNumbers("RecycledNumbers-Large");
    }

    public String execCase() throws IOException {
        int[] rango = ManejoArchivos.getInts();
        int numRecycled = 0;
        for(int number=rango[0];number<rango[1];number++) {
            String strNumber = String.valueOf(number);
            for(int i=0;i<strNumber.length()-1;i++) {
                strNumber = strNumber.substring(1) + strNumber.charAt(0);
                int newNumber = Integer.parseInt(strNumber);
                if( number < newNumber && newNumber <= rango[1] ) {
                    numRecycled++;
                    System.out.println(number + " " + newNumber);
                }
            }
        }

        return "" + numRecycled;
    }
}
