#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int q; cin >> q;
    while (q--) {
        ll n; cin >> n;
        string str; cin >> str;
        ll u = stoi(str.substr(str.size()-3));
        ll res = max(0LL, n-1000);
        for (ll i = 1; i <= min(n, 1000LL); ++i) {
            if ((u*i+999)/1000 <= ((u+1)*i-1)/1000) {
                res += 1;
            }
        }
        cout << res << "\n";
    }
}