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

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

import reusable.CodeJamBase;

public class RecycledNumbers {

	public static void main(String[] args) {
		new CodeJamBase("C-small-attempt0") {

			private int rotate(int value, int rotations, int totalRotations) {
				int tens = (int) Math.pow(10, rotations);
				int left = (int) Math.pow(10, totalRotations - rotations);

				return left * (value % tens) + (value / tens);
			}

			@Override
			protected String solution() {
				int[] input = nextIntArray();

				int lowerBound = input[0];
				int upperBound = input[1];

				Map<Integer, List<Integer>> distinctPairs = new HashMap<>();

				int result = 0;

				for (int n = lowerBound; n <= upperBound; n++) {
					int totalRotations = String.valueOf(lowerBound).length();

					for (int rotations = 1; rotations < totalRotations; rotations++) {
						int m = rotate(n, rotations, totalRotations);
						if (String.valueOf(m).length() != totalRotations) {
							continue;
						}

						if (distinctPairs.get(n) == null) {
							distinctPairs.put(n, new ArrayList<Integer>());
						}
						if (distinctPairs.get(n).contains(m)) {
							continue;
						}

						if ((lowerBound <= n) && (n < m) && (m <= upperBound)) {
							distinctPairs.get(n).add(m);
							result++;
						}
					}
				}

				return String.valueOf(result);
			}

		}.run();
	}

}
