def floor_sum(n,m,a,b):
    ans=0
    if a<0:
        a2=a%m
        return floor_sum(n,m,a2,b)-n*(n-1)*((a2-a)//m)//2
    if b<0:
        b2=b%m
        return floor_sum(n,m,a,b2)-n*((b2-b)//m)
    if a>=m:
        ans+=(n-1)*n*(a//m)//2
        a%=m
    if b>=m:
        ans+=n*(b//m)
        b%=m
    y_max=(a*n+b)//m
    x_max=(y_max*m-b)
    if y_max==0:
        return ans
    ans+=(n-(x_max+a-1)//a)*y_max
    ans+=floor_sum(y_max,a,m,(a-x_max%a)%a)
    return ans

T = int(input())
for _ in range(T):
    N, S = input().split()
    N = int(N)
    S1000= int(S.replace('.', ''))
    if S1000 == 100000:
        print(N)
        continue

    A = floor_sum(N+1, 1000, S1000+1, -1)-floor_sum(1, 1000, S1000+1, -1)
    B = floor_sum(N+1, 1000, S1000, -1)-floor_sum(1, 1000, S1000, -1)

    print(A-B)