def divceil(a, b):
  return (a + b - 1) // b

t = int(input())
for _ in range(t):
  n, s = input().split()
  n = int(n)
  s = int(s.split(".")[1])
  ans = 0
  for i in range(min(n + 1, 1000)):
    l, r = divceil(s * i, 1000), divceil((s + 1) * i, 1000)
    if r - l >= 1:
      ans += 1
  ans += max(0, n - 999)
  print(ans)