import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

# 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 = (1 << 63)-1
# inf = (1 << 31)-1
md = 10**9+7
# md = 998244353

mx = 10**9
def solve():
    n, k = LI()

    if k == 1 or n-1 == k:
        return []

    if k == 2:
        if n & 1: return []
        ans = []
        for i in range(n-1):
            if i & 1:
                ans.append((i+1, i+2, -mx))
            else:
                ans.append((i+1, i+2, mx-1))
        return ans

    if k == 3:
        return [(3, i, 2) for i in range(5, n+1)]+[(1, 2, 2), (2, 3, -5), (3, 4, 2)]

    m = (1+k+1)//2
    return [(i+1, i+2, -1) for i in range(k)]+[(m, i, n) for i in range(k+2, n+1)]

ans = solve()
if ans:
    print("Yes")
    for u, v, c in ans:
        print(u, v, c)
else:
    print("No")