#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

int main(){
	int t;
	cin >> t;
	vector<tuple<long long, int, int>> Q;
	rep(i, t){
		long long n;
		long double x;
		cin >> n >> x;
		x -= int(x);
		x *= 1000;
		Q.emplace_back(n, int(round(x)), i);
	}
	sort(Q.begin(), Q.end());
	int m = 0;
	vector<int> v(1000);
	auto up = [&](){
		m++;
		rep(i, m){
			v[(1000 * i) / m]++;
		}
	};
	vector<long long> ans(t);
	for(auto [n, y, idx] : Q){
		while(m < n and m < 1000){
			up();
		}
		long long res = 0;
		res += v[y];
		res += max(n - 1000, 0LL);
		ans[idx] = res;
	}
	rep(i, t){
		cout << ans[i] << "\n";
	}
	return 0;
}