#####################################   
import atexit, io, sys, collections, math, heapq, fractions,copy, os, functools 
import sys
import random
import collections

from io import BytesIO, IOBase
 
#####################################  python 3 START
BUFSIZE = 8192
 
class FastIO(IOBase):
    newlines = 0
 
    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None
 
    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()
 
    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()
 
    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)
 
class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")
 
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
#####################################  python 3 END





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


def f(n,d,k):
    print (n,d,k)
    if k == 1:
        if n != 2:
            print ('NO')
            return
        print ('YES')
        print ('1 2')
        return 
    # now k > 1
    adj = collections.defaultdict(list)
    for u in range(1, 1 + d):
        adj[u].append(u+1)
    if 1 + d > n:
        print ('NO')
        return 

    cur = 1 + d
    r = []
    i,j = [2,1],[1+d-1, 1]
    while(i[0] < j[0]):
        r.append(i[::])
        i[0] += 1
        i[1] += 1

        r.append(j[::])
        j[0] -= 1
        j[1] += 1
    if i[0] == j[0]:
        r.append(i)
    n -= d+1
    cur = d+2

    for node,depth in r:
        q = collections.deque([(node,0)])
        while(q):
            u,d = q.popleft()
            if n == 0:
                break
            if d < depth:
                for v in range(k - 1 + (-1 if node < d+1 else 0)):
                    adj[u].append(cur)
                    q.append((cur,d+1))
                    cur +=1
                    n -=1
                    if n == 0:
                        break
    if n > 0:
        print ('NO')
        return 
    print ('YES')
    for u in adj:
        for v in adj[u]:
            print ('{} {}'.format(u,v))

f(n,d,k)

