#include <bits/stdc++.h>
using namespace std;

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FILL(a, b) memset(a, b, sizeof(a))

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

const int mod = 1000000007;
const int LOG = 30;

void updAdd(int& x, int val) {
	x += val;
	if (x >= mod - 1) {
		x -= mod - 1;
	}
}

int mult(int a, int b) {
	return (LL)a * b % mod;
}

void updMult(int& x, int val) {
	x = mult(x, val);
}

int binPow(int a, int n) {
	int res = 1;
	while (n) {
		if (n & 1) {
			res = mult(res, a);
		}
		a = mult(a, a);
		n >>= 1;
	}
	return res;
}

int dpCnt[LOG][2][2], dpProd[LOG][2][2];

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int t;
	cin >> t;
	while (t--) {
		int l, r;
		cin >> l >> r;
		vector<int> dl, dr;
		while (l > 0) {
			dl.push_back(l % 10);
			l /= 10;
		}
		while (r > 0) {
			dr.push_back(r % 10);
			r /= 10;
		}
		while (SZ(dl) < SZ(dr)) {
			dl.push_back(0);
		}
		reverse(ALL(dl));
		reverse(ALL(dr));
		FOR(i, 0, LOG) {
			FOR(vl, 0, 2) {
				FOR(vr, 0, 2) {
					dpCnt[i][vl][vr] = 0;
					dpProd[i][vl][vr] = 1;
				}
			}
		}
		FOR(d, max(1, dl[0]), dr[0] + 1) {
			dpCnt[0][d == dl[0]][d == dr[0]]++;
			updMult(dpProd[0][d == dl[0]][d == dr[0]], d);
		}
		if (dl[0] == 0) {
			FOR(i, 1, SZ(dl)) {
				FOR(d, max(1, dl[i]), 10) {
					dpCnt[i][d == dl[i]][0]++;
					updMult(dpProd[i][d == dl[i]][0], d);
				}
				if (dl[i] != 0) {
					break;
				}
			}
		}
		FOR(pos, 0, SZ(dl) - 1) {
			FOR(vl, 0, 2) {
				FOR(vr, 0, 2) {
					int cnt = dpCnt[pos][vl][vr];
					if (cnt == 0) {
						continue;
					}
					FOR(d, vl ? dl[pos + 1] : 0, vr ? dr[pos + 1] + 1 : 10) {
						int nvl = vl && (d == dl[pos + 1]), nvr = vr && (d == dr[pos + 1]);
						updAdd(dpCnt[pos + 1][nvl][nvr], cnt);
						updMult(dpProd[pos + 1][nvl][nvr], mult(dpProd[pos][vl][vr], binPow(d, cnt)));
					}
				}
			}
		}
		int ans = 1;
		FOR(vl, 0, 2) {
			FOR(vr, 0, 2) {
				updMult(ans, dpProd[SZ(dl) - 1][vl][vr]);
			}
		}
		cout << ans << "\n";
	}
	return 0;
}