import java.util.Scanner;
import java.io.*;
import java.lang.Math;


public class C{
	public static int recycle(String str){
		String[] numbers = str.split(" ");
		int min = Integer.parseInt(numbers[0]);
		int max = Integer.parseInt(numbers[1]);
		int ret = 0;

		for(int i = min; i < max; i++){
			String num = i + "";
			int len = num.length();
			int k = i;
			for(int j = 1; j < len; j++){
				k = (k/10) + (int)java.lang.Math.pow(10.0,(double)(len-1))*(k%10);
				if (k > i && k <= max)
					ret++;
				else if(k == i)
					break;
			}
		}

		return ret;
	}

	public static void main(String[] args){
		Scanner sc = null;
		String next;
		int out;
		try{
			sc = new Scanner(new File("C-large.in"));
			int cases = Integer.parseInt(sc.nextLine());
			int current = 0;
			

			FileWriter fs = new FileWriter("output.txt");
			BufferedWriter buff = new BufferedWriter(fs);
			while(current < cases){
				next = sc.nextLine();
				current++;
				out = recycle(next);
				buff.write("Case #" + current + ": " + out + "\n");
			}
			buff.close();
		}
		catch(Exception ex){}
	}
}
package codejam2012;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

import reusable.CodeJamBase;

public class RecycledNumbers {

	public static void main(String[] args) {
		new CodeJamBase("C-large") {

			private int rotate(int value, int rotations, int totalRotations) {
				int tens = (int) Math.pow(10, rotations);
				int left = (int) Math.pow(10, totalRotations - rotations);

				return left * (value % tens) + (value / tens);
			}

			@Override
			protected String solution() {
				int[] input = nextIntArray();

				int lowerBound = input[0];
				int upperBound = input[1];

				Map<Integer, List<Integer>> distinctPairs = new HashMap<>();

				int result = 0;

				for (int n = lowerBound; n <= upperBound; n++) {
					int totalRotations = String.valueOf(lowerBound).length();

					for (int rotations = 1; rotations < totalRotations; rotations++) {
						int m = rotate(n, rotations, totalRotations);
						if (String.valueOf(m).length() != totalRotations) {
							continue;
						}

						if (distinctPairs.get(n) == null) {
							distinctPairs.put(n, new ArrayList<Integer>());
						}
						if (distinctPairs.get(n).contains(m)) {
							continue;
						}

						if ((lowerBound <= n) && (n < m) && (m <= upperBound)) {
							distinctPairs.get(n).add(m);
							result++;
						}
					}
				}

				return String.valueOf(result);
			}

		}.run();
	}

}
