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 com.khajochi.codejam;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashMap;

public class RecycledNumbers
{

	/**
	 * @param args
	 */
	public static void main(String[] args)
	{
		try
		{
			RecycledNumbers sp = new RecycledNumbers();

			FileInputStream fstream = new FileInputStream("/Users/msmart/Documents/My Work/Workspace/M/resource/2012round1/1CSmall.in");
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String str = br.readLine();
			int count = 1;
			while ((str = br.readLine()) != null)
			{
//				System.out.println(str);
				
				int start = Integer.parseInt(str.split(" ")[0]);
				int end = Integer.parseInt(str.split(" ")[1]);
				
				int possible = findPossible(start,end);
				
				System.out.println("Case #" + count++ + ": " + possible);
				
			}
			in.close();
		}
		catch (Exception e)
		{
			System.err.println(e);
		}
	
	}

	private static int findPossible(int start, int end)
	{
		int count = 0;
		HashMap <String, String> exclude = new HashMap <String, String>();
		
		for (int i = start; i <= end; i++)
		{
			String num = String.valueOf(i);
			
			if ( num.length() > 1 )
			{
				for (int j = 1; j < num.length(); j++)
				{
					int newNum = Integer.valueOf(num.substring(j,num.length()) + num.substring(0,j)).intValue();
//					System.out.println(newNum);
					
					if ( newNum >= start && newNum <= end && newNum != Integer.parseInt(num) )
					{
						boolean skip = false;
						
						if ( exclude.get(num) != null && exclude.get(num).equals(String.valueOf(newNum)) )
							skip = true;
						
						if ( exclude.get(newNum) != null && exclude.get(String.valueOf(newNum)).equals(num) )
							skip = true;
						
						if ( skip == false )
						{
//							System.out.println("Yes : " + num + " > " + newNum);
							exclude.put(num, String.valueOf(newNum));
							count++;
							continue;
						}
					}
				}
			}
		}
		
//		System.out.println(count/2);
		return count/2;
	}

}
