def solve():
    d,k = map(int,input().split())

    cand = set()

    for i in range(-d,d+1):
        dif = d - abs(i)
        cand.add((i,dif))
        cand.add((i,-dif))

    lis = []
    for x,y in cand:
        dis = x**2+y**2
        lis.append([dis,x,y])

    lis.sort()

    if len(lis) < k:
        print("No")
    else:
        print("Yes")
        x,y = lis[k-1][1:]
        print(x,y)
    return 

q = int(input())
for _ in range(q):
    solve()