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

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

import dancers.DancerEvaluation;

public class RecycledNumberFinder {

    public int findNumbers(int startPoint, int endPoint) {

	List<Pair> lstOfRecycledPairs = new ArrayList<RecycledNumberFinder.Pair>();

	for (int i = startPoint; i < endPoint; i++) {

	    String numberToBeChecked = Integer.toString(i);

	    char[] number = numberToBeChecked.toCharArray();

	    for (int j = 1; j < number.length; j++) {
		char[] prepend = Arrays.copyOfRange(number, number.length - j, number.length);
		char[] append = Arrays.copyOfRange(number, 0, number.length - j);
		String recycledNumberAsString = (new String(prepend) + new String(append));
		int recycledNumber = Integer.parseInt(recycledNumberAsString);
		if( recycledNumber <= endPoint && recycledNumber > i){
 		    Pair p = new Pair(i, recycledNumber);
 		    if(!lstOfRecycledPairs.contains(p))
 			lstOfRecycledPairs.add(p);
		}

	    }



	}


	return lstOfRecycledPairs.size();

    }

    public class Pair{
	private final int x;
	private final int y;

	public int getX() {
	    return x;
	}

	public int getY() {
	    return y;
	}

	public Pair(int x, int y) {
	    this.x = x;
	    this.y = y;

	}

	@Override
	public boolean equals(Object obj) {
	    Pair objPair = (Pair) obj;
	    return getX() == objPair.getX() && getY() == objPair.getY();
	}

    }


    public static void main(String[] args) throws Exception{
	BufferedReader reader = new BufferedReader(new FileReader(new File("C:\\Users\\maheshsa\\Desktop\\input.txt")));
	int numOfTestCases = Integer.parseInt(reader.readLine());
	FileWriter fw = new FileWriter(new File("C:\\Users\\maheshsa\\Desktop\\output.txt"));
	for (int i = 1; i <= numOfTestCases; i++) {
	    String[] inputAsString = reader.readLine().split(" ");
	    int[] input = new int[inputAsString.length];
	    for (int j = 0; j < inputAsString.length; j++) {
		input[j] = Integer.parseInt(inputAsString[j]);
	    }
	    int startPoint = input[0];
	    int endPoint = input[1];
	    fw.append("Case #" + i + ": " + new RecycledNumberFinder().findNumbers(startPoint, endPoint) + "\n");
	}

	fw.flush();

	reader.close();
	fw.close();
    }


}
