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

}
package codezam.util;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;
 
 
public class LCM {
        static HashMap<Long, Integer> factor;
        static BigInteger[][] dp;
        static long l;
        public static void main(String[] args) throws FileNotFoundException {
                Scanner r = new Scanner(System.in);
                int T = r.nextInt();
               
                while(T-- > 0){
                        int n = r.nextInt();
                        l = r.nextInt();
                       
                        factor = new HashMap<Long, Integer>();
                        int id = 0;
                        for(long d = 1; d * d <= l; d++)if(l % d == 0){
                                factor.put(d, id++);
                                if(d * d != l)factor.put(l / d, id++);
                        }
//                     
                        dp = new BigInteger[factor.size() + 1][n + 2];
                        for(int i  = 0; i < factor.size(); i++)
                                dp[i][0] = BigInteger.ZERO;
                        dp[factor.get(l)][0] = BigInteger.ONE;
                       
                       
                        BigInteger ways = go(1, n);
 
                        System.out.println(ways);
                }
        }
        static long gcd(long x, long y){
                if( y == 0 )return x;
                else return gcd(y, x % y);
        }
        private static BigInteger go(long lcm, int rem) {              
                if(rem == 0 && lcm == l)return BigInteger.ONE;
                if(rem == 0)return BigInteger.ZERO;
                System.out.println(lcm + ", " + rem);
               
                if(dp[factor.get(lcm)][rem] != null) return dp[factor.get(lcm)][rem];
                       
                BigInteger ways = BigInteger.ZERO;
                for(long d = 1; d * d <= l; d++)if(l % d == 0){
                        long lcmNEW1 = lcm * d / gcd(d, lcm);
                        long lcmNEW2 = lcm * (l/d) / gcd(l / d, lcm);
                       
                        ways = ways.add( go(lcmNEW1, rem - 1));
                        if(d * d != l)ways = ways.add( go(lcmNEW2, rem - 1));
                }
                return dp[factor.get(lcm)][rem] = ways;
        }
}