import sys
sys.setrecursionlimit(5*10**5)
input = sys.stdin.readline
from collections import defaultdict, deque, Counter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
from math import gcd

def sol():
    n,s = map(str,input().split())
    n = int(n)
    s = s.split(".")[0] + s.split(".")[1]
    s = int(s)
    ans = max(0, n-1000+1)
    for i in range(1,min(n+1,1000)):
        l = s*i
        r = (s+1)*i
        m = 1000*((l+999)//1000)
        if m < r:
            ans += 1
        
    print(*[ans])
    return 


T = int(input())
for i in range(T):
    sol()