#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
    int T;
    cin >> T;
    while(T--){
        ll n, s0, s1, s = 0;
        scanf("%lld %lld.%lld", &n, &s0, &s1);
        s = s0 * 1000 + s1;
        ll ans = 0, c = min(n, 1000ll);
        ans += max(0ll, n - 1000);
        for(ll i = 1; i <= c; i++){
            ll ng = -1, ok = 100 * i, mid;
            while(ng + 1 < ok){
                mid = (ng + ok) / 2;
                (mid * 1000 >= s * i ? ok : ng) = mid;
            }
            ans += (ok * 1000) / i == s;
        }
        printf("%lld\n", ans);
    }
}