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 recyclednumbers;

import java.util.Queue;
import java.util.concurrent.ArrayBlockingQueue;

public class Helper {
	public static void main(String[] str) {
		System.out.println(rotateDigits(345, 2, true));
	}
	
	public static int rotateDigits(int number, int noOfDigitesToBeMoved, boolean toLeft){
		String str = Integer.toString(number,1);
		char[] chArr = str.toCharArray();
		Queue<Character> numQueue = new ArrayBlockingQueue<Character>(chArr.length);
		for(int i = chArr.length-1; i >= 0; i--){
			numQueue.add(chArr[i]);
		}
		
		Queue<Character> polledItems = new ArrayBlockingQueue<Character>(noOfDigitesToBeMoved);
		
		for(int i = 0; i < noOfDigitesToBeMoved; i++){
			char item = numQueue.poll();
			polledItems.add(item);
		}
		
		for(char ch : polledItems){
			char item = polledItems.poll();
			numQueue.add(item);
		}	
		StringBuffer sb = new StringBuffer();
		for(int i = numQueue.size()-1; i >= 0 ; i--){
			sb.append(numQueue.toArray()[i]);
		}
		return Integer.parseInt(sb.toString());
	}

}
