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 fun.codeslam.recycling;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.Map;

public class Main
{
	/**
	 * @param args
	 * @throws IOException
	 */
	public static void main(String[] args) throws IOException
	{
		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

		Integer testCaseCount = Integer.parseInt(reader.readLine());

		for (Integer testCaseNumber = 1; testCaseNumber <= testCaseCount; testCaseNumber++)
		{
			String[] elements = reader.readLine().split(" ");
			System.out.append("Case #" + testCaseNumber + ": ");
			System.out.append(numberOfReyclingsInRange(Integer.parseInt(elements[0]), Integer.parseInt(elements[1]))
					.toString());
			System.out.append('\n');
		}
	}

	private static Integer numberOfReyclingsInRange(Integer min, Integer max)
	{
		Integer numberOfReyclings = 0;
		for (Integer number = min; number <= max; number++)
		{
			numberOfReyclings += numberOfReyclings(number, max);
		}
		return numberOfReyclings;
	}

	private static Integer numberOfReyclings(Integer number, Integer max)
	{
		Map<Integer, Boolean> isset = new HashMap<Integer, Boolean>();

		Integer numberOfReyclings = 0;
		Integer length = number.toString().length();

		for (Integer beginIndex = 1; beginIndex < length; beginIndex++)
		{
			String endPart = number.toString().substring(beginIndex);
			String frontPart = number.toString().substring(0, beginIndex);
			Integer newNumber = Integer.parseInt(endPart + frontPart);

			if (newNumber.toString().length() == number.toString().length() && number < newNumber && newNumber <= max
					&& isset.get(newNumber) == null)
			{
				isset.put(newNumber, true);
				numberOfReyclings++;
			}
		}

		return numberOfReyclings;
	}
}
