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.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.HashMap;


public class recycle {

    
    public static void rec() throws NumberFormatException, IOException {
        BufferedReader in = new BufferedReader(new FileReader("src/test1")); 

        String line;
        StringBuilder bubs = new StringBuilder();


        int T = Integer.parseInt(""+in.readLine().charAt(0));

        int i=0;
        while ((line=in.readLine())!=null) {
            i++;
            String[] splitline = line.split("\\s+");
            
            int A = Integer.parseInt(splitline[0]);
            int B = Integer.parseInt(splitline[1]);
            int d = splitline[0].length();

            StringBuilder subs = new StringBuilder();
            subs.append("Case #" + i + ": ");
            int count = 0;

            for (int n=A;n<B;n++) {
                String sn = ""+n;
                HashMap<Integer, Integer> hm = new HashMap();

                for (int b=0;b<d-1;b++) {
                    String r = sn.substring(d-1-b);
                    String l = sn.substring(0, d-1-b);
                    String btry = (r+l);
                    if (!hm.containsKey(Integer.parseInt(btry)) && btry.charAt(0)!='0' && Integer.parseInt(btry) > n && Integer.parseInt(btry) <=B) {
                        hm.put(Integer.parseInt(btry), 1);
                        count++;
            
                    }
                    
                }

            }
            subs.append(count);
            bubs.append(subs.toString());
            System.out.println(subs.toString());
        }
        

    }
    
}
