#include<bits/stdc++.h>
#include<atcoder/all>
#define chmin(x,y) (x) = min((x),(y))
#define chmax(x,y) (x) = max((x),(y))
#define ld long double
using namespace std;
using namespace atcoder;
using ll = long long;
const ll mod = 998244353;
using mint = modint998244353;
using Graph = vector<vector<pair<int,int>>>;
const vector<int> dx = {1,0,-1,0}, dy = {0,1,0,-1};

int main(){
  const int M = 1e4, L = 1000;
  vector<vector<int>> ok(L,vector<int>(M+1));
  for(int i = 1; i <= M; i++){
    for(int j = 0; j <= i; j++){
      int k = L*j/i;
      ok[k%L][i] = 1;
    }
    for(int j = 0; j < L; j++){
      ok[j][i] += ok[j][i-1];
    }
  }
  
  int t; cin >> t;
  while(t--){
    ll N; string S;
    cin >> N >> S;
    int D = 0; bool pnt = 0;
    for(auto c : S){
      if(c == '.') pnt = 1;
      else if(pnt){
        int d = c - '0';
        D *= 10;
        D += d;
      }
    }
    
    ll num = min(N,ll(M));
    ll ans = max(N-M,0LL) + ok[D][num];
    
    // cout << ok[D][num] << " ";
    
    cout << ans << endl;
  }
}