#include<bits/stdc++.h>

using namespace std;
using ll = long long;
using pint = pair<int,int>;
void solve();

int main()
{
	int T;
	cin >> T;
	while(T--)solve();
}

void solve()
{
	ll n,s;
	cin>>n;
	{
		ll sf,sb;
		scanf("%lld.%lld",&sf,&sb);
		s = sf*1000+sb;
	}
	cerr << n << " " << s << endl;

	ll ans = 0;
	for(int N=1; N<=n && N<= 1010; N++) {
		// if(N*S)
		ll F = N*s;
		ll B = N*(s+1);
		ll T = ((F+1000-1)/1000)*1000;
		if(B > T) ans++;
	}
	ans += max(0ll,n-1010);
	cout << ans << endl;
}