import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;

public class Q3M {
	public static void main(String[] args) throws Exception {
		compute();
	}

	private static void compute() throws Exception {
		BufferedReader br = new BufferedReader(new FileReader(new File(
				"C:\\work\\Q3\\C-small-attempt0.in")));
		String line = null;
		int i = Integer.parseInt(br.readLine());
		List l = new ArrayList();
		for (int j = 0; j < i; j++) {
			line = br.readLine();
			String[] nums = line.split(" ");
			l.add(calculate(nums));
		}
		writeOutput(l);
	}

	private static int calculate(String[] nums) {
		int min = Integer.parseInt(nums[0]);
		int max = Integer.parseInt(nums[1]);
		int count = 0;
		List l = new ArrayList();
		for (int i = min; i <= max; i++) {
			for (int times = 1; times < countDigits(i); times++) {
				int res = shiftNum(i, times);
				if (res <= max && i < res) {
					if ((!l.contains((i + ":" + res)))) {
						l.add(i + ":" + res);
						l.add(res + ":" + i);
						count++;
					}
				}
			}
		}
		return count;
	}

	private static boolean checkZeros(int temp, int res) {
		if (temp % 10 == 0 || res % 10 == 0)
			return false;
		return true;
	}

	private static int shiftNum(int n, int times) {
		int base = (int) Math.pow(10, times);
		int temp2 = n / base;
		int placeHolder = (int) Math.pow((double) 10,
				(double) countDigits(temp2));
		int res = placeHolder * (n % base) + temp2;
		if (countDigits(res) == countDigits(n)) {
			return res;
		} else {
			return 2000001;
		}
	}

	public static int countDigits(int x) {
		if (x < 10)
			return 1;
		else {
			return 1 + countDigits(x / 10);
		}
	}

	private static void writeOutput(List l) throws Exception {
		StringBuffer b = new StringBuffer();
		int i = 1;
		BufferedWriter br = new BufferedWriter(new FileWriter(new File(
				"C:\\work\\Q3\\ans.txt")));
		for (Iterator iterator = l.iterator(); iterator.hasNext();) {
			br.write("Case #" + i++ + ": " + iterator.next());
			br.newLine();
		}
		br.close();
	}

}
package qualification;

import java.io.*;

public class Csmall {
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new FileReader("./src/qualification/C-small-attempt0.in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter("./src/qualification/C-small-attempt0.out"));
		int[][] inputs = new int[50][2];
		int casenumber = 0;
		String input = null;
		int total = 0;
		while((input=br.readLine()) != null)
		{
			if(casenumber==0)
			{
				total = Integer.parseInt(input);
			}else{
				String[] array = input.split(" ");
				inputs[casenumber-1][0] = Integer.parseInt(array[0]);
				inputs[casenumber-1][1] = Integer.parseInt(array[1]);
			}
			casenumber++;
		}
		casenumber=1;
		while(casenumber <= total)
		{
			System.out.println("Case #" + casenumber + ": " + String.valueOf(recycledNumbers(inputs[casenumber-1][0], inputs[casenumber-1][1])));
			bw.write("Case #" + casenumber + ": " + String.valueOf(recycledNumbers(inputs[casenumber-1][0], inputs[casenumber-1][1])));
			bw.newLine();
			casenumber++;
		}
		bw.close();
	}
	
	public static int recycledNumbers(int a, int b) throws IOException
	{
		int[] storage = new int[2000000];
		int count=0;
		for(int i=a;i<b+1;i++)
		{
			for(int j=a+1;j<b+1;j++)
			{
				if(i!=j && storage[j]==0)
				{
					String icopy = String.valueOf(i);
					String jcopy = String.valueOf(j);
					for(int k=0;k<icopy.length();k++)
					{
						icopy = shiftString(icopy).toString();
						if(icopy.compareTo(jcopy)==0)
						{
							storage[i]=1;
							count++;
						}
					}
				}
			}
		}
		return count;
	}
	
	public static StringBuffer shiftString(String input)
	{
		StringBuffer output = new StringBuffer();
		output.append(input.charAt(input.length()-1));
		for(int i=0;i<input.length()-1;i++)
		{
			output.append(input.charAt(i));
		}
		return output;
	}
}