from operator import itemgetter
from itertools import *
from bisect import *
from collections import *
from heapq import *
import sys

sys.setrecursionlimit(10 ** 6)

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

# 2部グラフにして、左を小さい数、右を大きい数にすればいい
def main():
    n,m=MI()
    n1=n//2
    n0=n-n1
    if m<n-1 or m>n0*n1:
        print("NO")
        exit()

    aa=[-1]*n
    for i in range(n0):aa[2*i]=i+1
    for i in range(n1):aa[2*i+1]=n0+i+1

    uv=[]
    for u in range(1,n):uv.append((u,u+1))
    m-=n-1
    for u in range(1,n+1):
        for v in range(u+3,n+1,2):
            if m==0:break
            uv.append((u,v))
            m-=1
        if m==0:break

    print("YES")
    print(*aa)
    for u, v in uv: print(u, v)

main()