#include //#include using namespace std; //using namespace atcoder; //using mint = modint1000000007; //const int mod = 1000000007; //using mint = modint998244353; //const int mod = 998244353; //const int INF = 1e9; //const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n-1); i >= 0; --i) #define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define endl "\n" #define P pair template inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } long long calc(long long pre, long long lim) { if (0 == pre) return 0; long long ret = 0; long long pw = 1; while (pre <= lim) { ret += min(lim - pre + 1, pw); if (pre > lim / 10) break; pre *= 10; pw *= 10; } return ret; } long long solve(long long n, string k) { long long prefix = 0; long long ret = 0; rep(i, k.size()) { int num = k[i] - '0'; rep(j, num) { if (calc(prefix * 10 + j, n) < 0) { return 0; } ret += calc(prefix * 10 + j, n); } prefix = prefix * 10 + num; ret++; } return ret; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t; cin >> t; while (t--) { long long n; string k; cin >> n >> k; cout << solve(n, k) << endl; } return 0; }