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.BufferedWriter;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.io.Reader;
import java.util.HashSet;
import java.util.Set;


public class ProB {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		File infile = new File("C-small-attempt0.in");
		File outfile = new File("out.txt");
		BufferedReader reader = null;
		BufferedWriter writer = null;
		try{
			reader = new BufferedReader(new FileReader(infile));
			writer = new BufferedWriter(new FileWriter(outfile));
			String ss = reader.readLine();
			String out;
			String []nums;
			int t = Integer.parseInt(ss),i,j,res;
			int a,b;
			for(i=1;i<=t;i++){
				out = "Case #" + i + ": ";
				ss = reader.readLine();
				nums = ss.split(" ");
				a = Integer.parseInt(nums[0]);
				b = Integer.parseInt(nums[1]);
				res = 0;
				for(j=a;j<b;j++){
					res += isRecycle(j,b);
				}
				out += res;
				writer.write(out);
				writer.newLine();
			}
			reader.close();
			writer.close();
		}catch(Exception e){
			e.printStackTrace();
		}
	}
	
	private static int isRecycle(int p,int b){
		int res = 0;
		String s = "";
		Set set = new HashSet();
		s += p;
		int len = s.length();
		int base = 1,i,max;
		for(i=1;i<len;i++) base *= 10;
		max = base * 10;
		int head,tail;
		while(base >= 10){
			head = p / base;
			tail = p % base;
			if(tail >= (base / 10)){
				tail *= max / base;
				tail += head;
				if(tail > p && tail <=b) {
					if(!set.contains(tail)){
						set.add(tail);
						res++;
					}
				}
			}
			base /= 10;
		}
		return res;
	}
	
	private static void sort(int []scores,int n)
	{
		int i,j,t,s;
		for(i=0;i<n;i++){
			t = i;
			s = scores[i];
			for(j=i+1;j<n;j++){
				if(scores[j] > s){
					s = scores[j];
					t = j;
				}
			}
			s = scores[i];
			scores[i] = scores[t];
			scores[t] = s;
		}
	}

}
