#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 1;


void solve(){
    ll n; cin >> n;
    string s; cin >> s;

    ll x = 0;
    for(ll i=0; i<(ll)s.size(); i++) if(s[i]!='.'){
        x = 10*x + (ll)(s[i]-'0');
    }
    ll ans = max(0LL, n-1000);
    for(ll i=1; i<=min(n, 1000LL); i++){
        ll L = x*i;
        ll R = (x+1)*i;
        if(L%1000==0){
            ans++;
        }else{
            if(R%1000==0){
                if(R/1000 - L/1000 >1) ans++;
            }else{
                if(R/1000-L/1000>0) ans++;
            }
        }
    }

    cout << ans << '\n';
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    cin >> T;
    while(T--) solve();
}