import sys

sys.setrecursionlimit(10**6)
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

n, k = LI()
if n == k or n%k or n*(n+1)//2%k:
    print("No")
    exit()

ans = []
h = n//k
base=1

if h & 1:
    aa=list(range(k+1,2*k+1))
    aa.sort(key=lambda x:(x%2,-x))
    s=3*(3*k+1)//2
    for j in range(k):
        ans.append([j+1,aa[j],s-(j+1)-aa[j]])
    h -= 3
    base+=k*3

for a in range(h*k//2):
    ans[a%k] += [a+base, h*k-1-a+base]

print("Yes")
for row in ans: print(*row)