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.*;
import java.util.*;

class CodejamC {
    public static int power[];
    public static void main (String [] args) throws IOException {
        BufferedReader in = new BufferedReader(new FileReader("E:/C-small-attempt0.in"));
        PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("E:/outC.txt")));
        int nTest = Integer.parseInt(in.readLine());
        power = new int[10];
        power[0] = 1;
        for (int i = 1; i < power.length; i++) {
            power[i] = power[i-1] * 10;
        }
        for (int testIndex = 0; testIndex < nTest; testIndex++) {
            out.print("Case #" + (testIndex + 1) + ": ");
            /***** start **********/
            StringTokenizer st = new StringTokenizer(in.readLine());
            int a = Integer.parseInt(st.nextToken());
            int b = Integer.parseInt(st.nextToken());
            long result = 0;
            for (int p = a; p <= b; p++) {
                int len = getLen(p);
                int q = p;
                for (int offset = 1; offset < len; offset++) {
                    int t = q * 10;
                    q = t % power[len] + t / power[len];
                    if (q == p) {
                        break;
                    }
                    if (q <= b && q > p) {
                        result++;
                    }
                }
            }
            out.print(result);
            /***** end   **********/
            out.println();
        }
        out.close();
    }
    public static int getLen(long l) {
        for (int i = 1; i < 10; i++) {
            if (l < power[i]) {
                return i;
            }
        }
        return -1;
    }
    public static int itoa(int a, char[] s) {
        int len = 0;
        while (a > 0) {
            s[len] = (char) (a % 10 + '0');
            a /= 10;
            len++;
        }
        return len;
    }
    /*
     * for (int i = lenCurrent - 1; i >= 0; i--) {
                        int shiftIndex = i + offset;
                        if (shiftIndex >= lenCurrent) {
                            shiftIndex -= lenCurrent;
                        }
                        if (lenMax <= lenCurrent && current[shiftIndex] > max[i]) {
                            continue;
                        }
                    }
                    for (int i = lenCurrent - 1; i >= 0; i--) {
                        int shiftIndex = i + offset;
                        if (shiftIndex >= lenCurrent) {
                            shiftIndex -= lenCurrent;
                        }
                        if (lenMax <= lenCurrent && current[shiftIndex] > max[i]) {
                            continue;
                        }
                        if (current[shiftIndex] > current[i]) {
                            ok = true;
                            break;
                        } else if (current[shiftIndex] < current[i]) {
                            break;
                        }
                    }
                    if (ok) {
                        result++;
                    }
                    
                    for (int i = lenCurrent - 1; i >= 0; i--) {
                        int shiftIndex = i + offset;
                        if (shiftIndex >= lenCurrent) {
                            shiftIndex -= lenCurrent;
                        }
                        if (lenMax <= lenCurrent && current[shiftIndex] > max[i]) {
                            continue;
                        }
                    }
                    for (int i = lenCurrent - 1; i >= 0; i--) {
                        int shiftIndex = i + offset;
                        if (shiftIndex >= lenCurrent) {
                            shiftIndex -= lenCurrent;
                        }
                        if (lenMax <= lenCurrent && current[shiftIndex] > max[i]) {
                            continue;
                        }
                        if (current[shiftIndex] > current[i]) {
                            ok = true;
                            break;
                        } else if (current[shiftIndex] < current[i]) {
                            break;
                        }
                    }
                    if (ok) {
                        result++;
                    }
                    */
}