Problem: Volodya is an odd boy and his taste is strange as well. It seems to him that a positive integer number is beautiful if and only if it is divisible by each of its nonzero digits. We will not argue with this and just count the quantity of beautiful numbers in given ranges.

Input

The first line of the input contains the number of cases t (1 ≤ t ≤ 10). Each of the next t lines contains two natural numbers li and ri (1 ≤ li ≤ ri ≤ 9 ·1018).

Please, do not use %lld specificator to read or write 64-bit integers in C++. It is preffered to use cin (also you may use %I64d).

Output

Output should contain t numbers — answers to the queries, one number per line — quantities of beautiful numbers in given intervals (from li to ri, inclusively).

Examples

Input

1
1 9


Output

9


Input

1
12 15


Output

2

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;
import java.math.BigInteger;

public class BeautifulNumbers {
	public static void main(String[] args) {
		new main().run();
	}
}

class main {

	void run() {
		Scanner cin = new Scanner(System.in);
		int t = cin.nextInt();
		while (t-- > 0) {
			long l = cin.nextLong(), r = cin.nextLong();
			System.out.println(calculation(r) - calculation(l - 1));
		}
		cin.close();
	}

	long calculation(long val) {
		int bit = 0;
		while (val > 0) {
			dight[bit++] = (int) (val % 10);
			val /= 10;
		}
		return dfs(bit - 1, 0, 1, true);
	}

	long dfs(int pos, int sum, int lcm, Boolean isEnd) {
		if (pos < 0)
			return sum % lcm == 0 ? 1L : 0L;
		if (!isEnd && dp[pos][sum][hash[lcm]] != -1)
			return dp[pos][sum][hash[lcm]];
		int end = isEnd ? dight[pos] : 9;
		long res = 0L;
		for (int i = 0; i <= end; i++) {
			res += dfs(pos - 1, (sum * 10 + i) % N, lcm(lcm, i), isEnd && i == end);
		}
		if (!isEnd)
			dp[pos][sum][hash[lcm]] = res;
		return res;
	}

	final int N = 2520;
	long[][][] dp = new long[19][N][48];
	int[] dight = new int[19];

	int[] hash = new int[N + 8];
	{
		int cnt = 0;
		for (int i = 1; i <= N; i++) {
			if (N % i == 0)
				hash[i] = cnt++;
		}
		for (int i = 0; i < 18; i++) {
			for (int j = 0; j < N; j++)
				Arrays.fill(dp[i][j], -1);
		}
	}

	int gcd(int x, int y) {
		return y == 0 ? x : gcd(y, x % y);
	}

	int lcm(int x, int y) {
		if (x == 0)
			return y;
		if (y == 0)
			return x;
		return x / gcd(x, y) * y;
	}

}