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.qualification;

import java.io.IOException;
import java.util.HashSet;
import java.util.Set;

import codejam.Task;

public class C extends Task {

	private int t;
	private String[][] testCases;
	private String[] resultset;

	public C(String[] args) {
		super(args);
	}

	public static void main(String[] args) throws IOException {
		Task taskC = new C(args);
		taskC.execute();
	}

	protected void catchInputData() throws IOException {
		t = Integer.parseInt(readLine());
		testCases = new String[t][];

		// iterates over cases
		for (int c = 0; c < t; c++) {
			testCases[c] = readLine().split(" ");
		}
	}

	protected void processInputData() {
		resultset = new String[t];

		// iterates over cases
		for (int c = 0; c < t; c++) {
			String[] testCase = testCases[c];
			
			int a = Integer.parseInt(testCase[0]);
			int b = Integer.parseInt(testCase[1]);
			int y = 0;
			
			for (int n = a; n < b; n++) {
				Set<Integer> mset = new HashSet<Integer>();
				String sn = String.valueOf(n);
				for (int i = 1; i < sn.length(); i++) {
					if (sn.charAt(i) != '0') {
						String sm = sn.substring(i) + sn.substring(0, i);
						int m = Integer.parseInt(sm);
						if (m > n && m <= b && !mset.contains(m)) {
							y++;
							mset.add(m);
						}
					}
				}
			}
			
			resultset[c] = ""+y;
		}
	}

	protected void generateOutputFile() throws IOException {
		// iterates over cases
		for (int c = 0; c < t; c++) {
			writeLine("Case #" + (c + 1) + ": " + resultset[c]);
		}
	}

}
