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 codejam.contest;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.InputStreamReader;

public class ProblemC
{
	public static void main(String[]arg)
	{
		try
		{
			FileInputStream fInputStream = new FileInputStream(arg[0]);
			DataInputStream in = new DataInputStream(fInputStream);
			BufferedReader reader = new BufferedReader(new InputStreamReader(in));
			String strLine;
			int i = 0;
			while ((strLine = reader.readLine()) != null)
			{
				if (i > 0)
				{
					int intLowLimit = Integer.parseInt(strLine.split(" ")[0]);
					int intSupLimit = Integer.parseInt(strLine.split(" ")[1]);

					System.out.println("Case #" + i + ": " + getResult(intLowLimit, intSupLimit));
				}

				i++;
			}
		}
		catch (Exception e)
		{
			e.printStackTrace();
		}
	}

	private static int getResult(int intLowLimit, int intSupLimit)
	{
		int result = 0;

		for (int numberN = intLowLimit; numberN <= intSupLimit; numberN++)
		{
			for (int numberM = numberN + 1; numberM <= intSupLimit; numberM++)
			{
				if (recycledPair(Integer.toString(numberN), Integer.toString(numberM)))
					result++;
			}
		}
		return result;
	}

	private static boolean recycledPair(String n, String m)
	{
		boolean result = false;

		for (int i = 1; i < m.length(); i++)
		{
			String strAux = m.substring(i);
			strAux = strAux + m.substring(0, i);
			if (strAux.equals(n))
				result = true;
		}

		return result;
	}
}
