import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7

def solve():
    n,t=LI()
    if t&1==0:
        ans = [[0]*n for _ in range(n)]
        for i in range(n-1):
            ans[0][i+1]=t//2
    elif (t-(n-2))&1==0:
        ans = [[1]*n for _ in range(n)]
        c=(t-(n-2))//2
        for i in range(n-1):
            ans[0][i+1]=c
    else:
        print("No")
        return
    print("Yes")
    for j in range(n):
        for i in range(j):
            print(i+1,j+1,ans[i][j])
    return

for _ in range(II()):
    solve()