#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int q[10] = {1, 10, 5, 10, 5, 2, 5, 10, 5, 10};
int t, k[N];
long long a[N];
int main() {
	freopen("mul.in", "r", stdin);
	freopen("mul.out", "w", stdout);
	cin >> t;
	for (int i = 1; i <= t; i++) {
		cin >> a[i] >> k[i];
		long long n = 0, m = 0, ans = 1;
		while (a[i] % 10 == 0) {
			a[i] /= 10;
			m ++;
		}
		n = a[i] % 10;
		if (m >= k[i]) {
			cout << 1 << endl;
			continue;
		}
		while (m < k[i]) {
			ans *= q[n];
			a[i] *= q[n];
			n = (a[i] / 10) % 10;
			a[i] /= 10;
			m++;
		}
		cout << ans << endl;
	}
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
const int N = 3005;
int n, l, r, a[N], ans, num = 0x3f3f3f3f;
int main() {
    freopen("mod.in", "r", stdin);
    freopen("mod.out", "w", stdout);
	cin >> n >> l >> r;
	for (int i = 1; i <= n; i++) cin >> a[i];
	for (int k = l; k <= r; k++) {
		int sum = 0;
		for (int i = 1; i <= n; i++) sum += a[i]%k;
	    if (num > sum) {
	    	num = sum;
	    	ans = k;
		}
 	} 
	cout << ans;
	return 0;
}