import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
input = sys.stdin.readline
t = int(input())
#alist = list(map(int,input().split()))
#alist = []
q = decimal.Decimal('0.001')
for i in range(t):
    n,s = input().split()
    n = int(n)
    
    s = decimal.Decimal(s)
    ans = 0
    for j in range(1,min(n+1,1000)):
        x = math.ceil(s*j)
        y = math.ceil((s+q)*j)
        #print(s,s+q,x,y,i,j)
        c = 0
        for k in range(x,y):
            if 0 <= k <= 100*j:
                c = 1
        ans += c
    print(ans + max(0,n-999))