#include <bits/stdc++.h>
#pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#pragma GCC optimize(2)
using namespace std;
#define int long long

int l, r, tot, dp[2][52][2521][2], had, g[2521], llcm[2521][12];
vector<int> fcts;
char d[1004];

int lcm(int a, int b) {
	if (!a || !b) return a | b;
	return a / __gcd(a, b) * b;
}

//int dfs(int i, int f, int b, int limited) {
//	if (i == tot) return f == 0 || (b % f) == 0;
//	if (vis[i][g[f]][b][limited]) return dp[i][g[f]][b][limited];
//	long long ans = 0;
//	for (int j = 0; j <= max(limited * 9, 1ll * d[i]); ++j) {
//		ans += dfs(i + 1, llcm[f][j], (b * 10 + j) % 2520, limited || (j != d[i]));
//	}
//	return vis[i][g[f]][b][limited] = 1, dp[i][g[f]][b][limited] = ans;
//}

int dpp() {
	for (int i = tot; i >= 0; --i) {
		for (auto f : fcts) {
			for (int b = 0; b < 2520; ++b) {
				for (int limited = 0; limited <= 1; ++limited) {
					if (i == tot) dp[i & 1][g[f]][b][limited] = ((f == 0) || (b % f == 0));
					else {
						long long ans = 0;
						for (int j = 0; j <= max(limited * 9, 1ll * d[i]); ++j) {
							ans += dp[(i + 1) & 1][g[llcm[f][j]]][(b * 10 + j) % 2520][limited || (j != d[i])];
						}
						dp[i & 1][g[f]][b][limited] = ans;
					}
				}
			}
		}
	}
	return dp[0][g[0]][0][0];
}

signed main() {
	for (int i = 0; i < 2521; ++i) {
		for (int j = 0; j < 10; ++j) llcm[i][j] = lcm(i, j);
	}
	int t;
	scanf("%lld", &t);
	for (int f = 0; f < 512; ++f) {
		int res = 0;
		for (int i = 1; i <= 9; ++i) {
			if (f & (1 << (i - 1)))
			res = lcm(res, i);
		}
		if (!g[res]) {
			g[res] = ++had;
			fcts.emplace_back(res);
		}
	}
	while (t--) {
		scanf("%s", d);
		tot = strlen(d);
		for (int i = tot - 1; i >= 0; --i) {
			if (d[i] != '0') {
				--d[i];
				break;
			} else {
				d[i] = '9';
			}
		}
		for (int i = 0; i < tot; ++i) d[i] -= '0';
		long long tmp = dpp();
		scanf("%s", d);
		tot = strlen(d);
		for (int i = 0; i < tot; ++i) d[i] -= '0';
		printf("%lld\n", dpp() - tmp);
	}
}