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

import java.io.File;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

/**
 * @author Gaurav Prabhu Gaonkar 
 * @date   Apr 13, 2012 
 *
 */
public class RecycledNumbers {

	public static void main(String[] args) {
		String inputDir = "C:\\GcjFiles\\2012\\Qualification";
		String fileName = "C-small-attempt0";
		
		File inputFile = new File(inputDir + "\\" + fileName + ".in");
		File outputFile = new File(inputDir + "\\" + fileName + ".out.txt");

		try
		{
			PrintWriter out = new PrintWriter(outputFile);			
			Scanner scanner = new Scanner(inputFile);			
			//Read the first line
			String metadata   = scanner.nextLine();
			int numOfCases = Integer.parseInt(metadata);
			//System.out.println(numOfCases);
			
			for(int i = 1; i <= numOfCases; i++)
			{
				String input = scanner.nextLine();
				//System.out.println(input);						
				String[] params = input.split(" ");
								
				int answer = solve(Integer.parseInt(params[0]), Integer.parseInt(params[1]));
				System.out.println("Case #"+i+": " + answer);
				out.println("Case #"+i+": " + answer);
			} // process next test case
			
			out.flush();
			out.close();
		}
		catch(Exception e)
		{
			System.out.println("Exception Occured: "  + e);
		}		
	}

	private static int solve(int a, int b) {
		int result = 0;
		
		if (a < 10) {
			a = 10;
		}
		
		Set<String> candidates = new HashSet<String>();		
		for (int i = a; i <= b; i++) {
			
			StringBuilder sb = new StringBuilder();
			sb.append(i).append(i);
			
			int len = sb.length()/2;
			
			String str = sb.toString();
			
			for (int j = 1; j <= len; j++) {
				candidates.add(str.substring(j,j+len));				
			}			
			for (String candidate : candidates) {
				int test = Integer.parseInt(candidate);
				if (test > i && (test >= a && test <= b)) {
					result++;
				}
			}
			candidates.clear();
		}
		
		return result;
	}
}
