n, k = map(int, input().split())

if k == n - 1 or k == 1:
    print("No")
else:
    # Create the central chain
    edges = []
    for i in range(1, k + 2):
        if i == k:
            # Calculate B
            B = (k - 1) * 2 + 1
            w = -B
        else:
            w = 2
        u = i
        v = i + 1
        edges.append((u, v, w))
    
    # Connect remaining nodes
    for node in range(k + 3, n + 1):
        u = 1
        v = node
        w = 10**9
        edges.append((u, v, w))
    
    print("Yes")
    for edge in edges:
        print(edge[0], edge[1], edge[2])