#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint998244353;
//const int mod = 998244353;
//using mint = modint1000000007;
//const int mod = 1000000007;
//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 P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int f(string s) {
	int ret = 0;
	rep2(i, s.size() - 3, s.size()) {
		ret *= 10;
		ret += s[i] - '0';
	}
	return ret;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		long long n; cin >> n;
		string s; cin >> s;
		long long score = stoll(s.substr(0, s.size() - 4)) * 1000 + stoll(s.substr(s.size() - 3, 3));
		long long ans = max(0LL, n - 1000);
		long long m = f(s);
		rep2(i, 1, 1 + min(1000LL, n)) {
			int l = score * i;
			int mid = ((l + 1000 - 1) / 1000) * 1000;
			int r = (score + 1)*i;
			if (mid <= r)ans++;
		}
		cout << ans << endl;
	}
	return 0;
}