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

public class RecycledNumbersProblem {

	private int minValue;
	private int maxValue;

	public RecycledNumbersProblem(String problemAsString) {
		String[] split = problemAsString.split(" ");
		minValue = Integer.parseInt(split[0]);
		maxValue = Integer.parseInt(split[1]);
	}

	public int solve() {
		int result = 0;
		DigitsArray minValueDigitsArray = new DigitsArray(minValue);
		DigitsArray maxValueDigitsArray = new DigitsArray(maxValue);
		for (int i = 0; i <= maxValue - minValue; i++) {
			DigitsArray toTest = new DigitsArray(minValue + i);
			result += toTest.numberRecycles(minValueDigitsArray,
					maxValueDigitsArray);
		}
		return result;
	}

}
