def solve(d, k):
  if d==0 and k==1:
    print("Yes")
    print(0, 0)
    return
  ans = []
  if (4*d < k):
    print("No")
    return
  for x in range(d):
    dist = x**2 + (d-x)**2
    ans.append([dist, x, d-x])
    ans.append([dist, x, x-d])
    ans.append([dist, -x, d-x])
    ans.append([dist, -x, x-d])
  ans.sort()
  #print(ans)
  _, x, y = ans[k-1]
  print("Yes")
  print(x, y)
Q = int(input())
ans =-1
for item in range(Q):
	d, k = map(int, input().split())
	solve(d, k)