Q=int(input())

D={};A=[]
for i in range(-200,201):
  for j in range(-200,201):
    d=abs(i)+abs(j)
    if d not in D:
      D[d]=[]
    D[d].append((i**2+j**2,i,j))
    A.append(d)
for d in D:
  D[d]=sorted(D[d])

import bisect
for _ in range(Q):
  d,k=map(int, input().split())
  if len(D[d])<k:
    print('No')
  else:
    print('Yes')
    print(D[d][-1][-2],D[d][-1][-1])