Q, K = map(int, input().split())
a = [[0, 0], [0, 1], [1, 0], [1, 1]]
s = [0, 1, 1, 2]
def f(querys):
    l = len(a[0])
    if l == Q + 2 and max(s) <= K:
        print('Yes')
        for i in range(Q):
            print(querys[i][0] + 1, querys[i][1] + 1)
        exit()
        return
    for i in range(l - 1):
        for j in range(i + 1, l):
            for k in range(4):
                b = 1 ^ (a[k][i] & a[k][j])
                a[k].append(b)
                s[k] += b
            querys.append([i, j])
            if max(s) <= 4:
                f(querys)
            querys.pop()
            for k in range(4):
                b = 1 ^ (a[k][i] & a[k][j])
                a[k].pop()
                s[k] -= b
f([])
if K <= 4:
    print('No')
else:
    print('Yes')
    ans = [[1, 2], [1, 2], [3, 4], [4, 5], [4, 5]]
    while len(ans) > Q:
        ans.pop()
    while len(ans) < Q:
        ans.append([6, 7])
    for i in range(Q):
        print(ans[i][0], ans[i][1])