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){}
	}
}
import java.io.File;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class RecycledNumbers {

	/**
	 * @param args
	 * @throws IOException
	 */
	public static void main(String[] args) throws IOException {
		Scanner sc = new Scanner(new File("data/C-large.in"));
		PrintWriter out = new PrintWriter(new File("data/output.txt"));

		Integer count = sc.nextInt();
		System.out.println(count);

		for (int i = 0; i < count; i++) {
			System.out.println(i);
			out.println("Case #" + (i + 1) + ": "
					+ countRecycled(sc.nextInt(), sc.nextInt()));
		}

		out.close();
	}

	private static int countRecycled(Integer iA, Integer iB) {
		Set<String> recycled = new HashSet<String>();
		if (iA.toString().length() != iB.toString().length()) {
			return 0;
		}

		System.out.println();
		System.out.println(iA + " " + iB);
		System.out.println();
		int sLength = iA.toString().length();

		for (Integer n = iA; n <= iB; n++) {

			for (int c = 1; c <= sLength; c++) {
				String left = n.toString().substring(sLength - c, sLength);
				String right = n.toString().substring(0, sLength - c);
				String newNumber = left + right;
				// System.out.println(left + "-" + right + "-" + newNumber);
				int intNew = Integer.parseInt(newNumber);
				if (!newNumber.startsWith("0") // same length
						&& intNew <= iB // within range
						&& intNew > n // bigger than the other one
				) {
					recycled.add(n.toString() + "," + newNumber);
				}

			}
		}

		return recycled.size();
	}
}
