// Problem: L. Digit Product
// Contest: QOJ - The 2019 ICPC China Shaanxi Provincial Programming Contest
// URL: https://qoj.ac/contest/1285/problem/6731
// Memory Limit: 256 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
	function<void ()> solve = []() -> void {
		int l, r;
		scanf("%d%d",&l, &r);
		long long val = 1;
		for (int i = l; i <= r; i++) {
			for (int zxx = i; zxx; zxx /= 10) {
				val = 1ll * val * (zxx % 10) % mod;
				if (! val) {
					printf("0\n");
					return ;
				} 
			}
		}
		printf("%lld\n", val);
		return ;
	};
	int _;
	scanf("%d", &_);
	for (; _; _--) {
		solve();
	}
	return 0; 
}