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();
	}

}
import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.util.ArrayList;

public class Pairs {

	public static void main(String[] args) throws Exception {

		BufferedReader fis = new BufferedReader(new FileReader(
				new File("input")));
		String numCasesStr = fis.readLine();
		int numCases = Integer.parseInt(numCasesStr);
		String val = "";
		int caseNum = 1;
		while ((val = fis.readLine()) != null) {
			String out = eval(val);
			System.out.println("Case #" + caseNum + ": " + out);
			caseNum++;
		}

	}

	private static String eval(String val) {
		String[] vals = val.split(" ");
		int a = Integer.parseInt(vals[0]);
		int b = Integer.parseInt(vals[1]);
		
		int out = 0;
		ArrayList<String> ss = new ArrayList<String>();
		
		if (b > 10 && a != b) {
			for(int i = a; i <= b; i++) {
				//Are there any rotations of i which is less than b
				String m = "" + i;
				for(int j = 0; j < m.length()-1; j++) {
					m = m.substring(1) + m.substring(0, 1);
					if(m.startsWith("0")) {
						continue;
					}
					int n = Integer.parseInt(m);
					if(n <= b && n > i) {
						String v = i  + " , " + m;
						if(!ss.contains(v)) {
							//Skip cases such as ???????1212 , 2121
							ss.add(v);
							out++;
						}
						
					}
				}
			}
		}
		
		return "" + out;
	}
	

}
