import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines

N,M=map(int,readline().split())
n=N//2
if M<N-1 or n*(N-n)<M:
    print("NO")
else:
    print("YES")
    print(*[i for i in range(1,N+1)])
    print(1,n+1)
    for j in range(n+1,N):
        print(1,j+1)
    for i in range(1,n):
        print(i+1,n+1)
    M-=N-1
    for i in range(1,n):
        for j in range(n+1,N):
            if M:
                print(i+1,j+1)
                M-=1
            else:
                exit()