import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

class RecycledNumbers{
	
	
	
	int getcount(int small,int large){
		int count = 0;
		for(int currnum = small; currnum < large; currnum++){
			int permut = currnum;
			int no_of_digits = 0;
			while(permut > 0){
				permut = permut/10;
				no_of_digits++;
			}
			int lastDigit = currnum % 10;
			permut = currnum / 10;
			permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
			while(permut != currnum){
				
				if(permut >= currnum && permut <= large){
					
					count++;
				}
				lastDigit = permut % 10;
				permut = permut / 10;
				permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
				
			}
			
		}
		
		return count;
	}
	
	public static void main(String args[]){
		RecycledNumbers d = new RecycledNumbers();
		
		int no_of_cases = 0;
		String input = "";
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		try{
			no_of_cases = Integer.parseInt(br.readLine());
		}
		catch(Exception e){
			System.out.println("First line is not a number");
		}
		
		for(int i=1; i <= no_of_cases;i++){
			try{
				input = br.readLine();
			}
			catch(Exception e){
				System.out.println("Number of test cases different from the number mentioned in first line");
			}
			
			System.out.print("Case #" +i+": ");
			
			StringTokenizer t =  new StringTokenizer(input);
			int small=0,large=0;
			if(t.hasMoreTokens()){
				small = Integer.parseInt(t.nextToken());
			}
			if(t.hasMoreTokens()){
				large = Integer.parseInt(t.nextToken());
			}
			System.out.println(d.getcount(small,large));
			
		}
		
		
		

	}
	
	
}
package google.codejam2012.qualification;

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class RecycledNumbers {
	
	static private int getDigitsCount(int number) {
		int sh = 10;
		int digits = 1;
		while (sh <= number) {
			sh *= 10;
			digits++;
		}
		return digits;
	}
	
	static private int getRecyclingPairsCount(int number, int limit) {
		int digits = getDigitsCount(number);
		int sh = 1;
		for (int i = 1; i < digits; i++) {
			sh *= 10;
		}
		int permutation = number;
		int result = 0;
		int[] usedNumbers = new int[digits];
		int usedNumbersCount = 0;
		for (int i = 1; i < digits; i++) {
			permutation = (permutation % 10) * sh + (permutation / 10);
			if (number < permutation & permutation <= limit) {
				boolean isNumberAlreadyUsed = false;
				for (int j = 0; j < usedNumbersCount; j++) {
					if (usedNumbers[j] == permutation) {
						isNumberAlreadyUsed = true;
						break;
					}
				}
				if (!isNumberAlreadyUsed) {
					usedNumbers[usedNumbersCount++] = permutation;
					result++;
				}
			}
		}
		return result;
	}
	
	static public void main(String[] args) {
		try {
			BufferedReader br = new BufferedReader(new InputStreamReader(System.in), 64 << 10);
			int testsNumber = Integer.parseInt(br.readLine().trim());
			for (int test = 1; test <= testsNumber; test++) {
				StringTokenizer tokenizer = new StringTokenizer(br.readLine());
				int startingNumber = Integer.parseInt(tokenizer.nextToken());
				int endingNumber = Integer.parseInt(tokenizer.nextToken());
				int result = 0;
				for (int number = startingNumber; number <= endingNumber; number++) {
					result += getRecyclingPairsCount(number, endingNumber);
				}
				System.out.println("Case #" + test + ": " + result);
			}
		}
		catch (Exception e) {
			System.err.println("Error:" + e.getMessage());
		}
	}
}
