def solve():
    n, k = map(int, input().split())
    lst = []
    for i in range(n + 1):
        j = n - i
        lst.append((i, j))
        if j != 0:
            lst.append((i, -j))
        if i != 0:
            lst.append((-i, -j))
            if j != 0:
                lst.append((-i, -j))
    if k > len(lst):
        print("No")
        return
    lst.sort(key=lambda x: x[0] * x[0] + x[1] * x[1])
    print("Yes")
    print(*lst[k - 1])


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