# 3, 5, 7, inf
def solve():
    q, k = map(int, input().split())
    n = q + 2
    if k == 2:
        if n > 3:
            return []
        else:
            return [(1, 2)]
    elif k == 3:
        if n > 5:
            return []
        else:
            return [(1, 2), (1, 2), (3, 4)][:q]
    elif k == 4:
        if n > 7:
            return []
        else:
            return [(1, 2), (1, 2), (1, 2), (3, 4), (3, 4)][:q]
    else:
        return ([(1, 2), (1, 2), (3, 4), (3, 5), (3, 5)] + [(6, 7)] * max(0, q - 5))[:q]

res = solve()
if not res:
    print('No')
else:
    print('Yes')
    for i, j in res:
        print(i, j)