import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.*;
import java.util.*;
import java.math.*;
import java.lang.*;
import java.util.PriorityQueue;
import static java.lang.Math.*;

public class solution implements Runnable {
    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private SpaceCharFilter filter;
        private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        public InputReader(InputStream stream) {
            this.stream = stream;
        }
        
        public int read() {
            if (numChars==-1) 
                throw new InputMismatchException();
            
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                }
                catch (IOException e) {
                    throw new InputMismatchException();
                }
                
                if(numChars <= 0)               
                    return -1;
            }
            return buf[curChar++];
        }
     
        public String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            }
            catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
        public int nextInt() {
            int c = read();
            
            while(isSpaceChar(c)) 
                c = read();
            
            int sgn = 1;
            
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            
            int res = 0;
            do {
                if(c<'0'||c>'9') 
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }
            while (!isSpaceChar(c)); 
            
            return res * sgn;
        }
        
        public long nextLong() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            long res = 0;
            
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }
            while (!isSpaceChar(c));
                return res * sgn;
        }
        
        public double nextDouble() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            double res = 0;
            while (!isSpaceChar(c) && c != '.') {
                if (c == 'e' || c == 'E')
                    return res * Math.pow(10, nextInt());
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }
            if (c == '.') {
                c = read();
                double m = 1;
                while (!isSpaceChar(c)) {
                    if (c == 'e' || c == 'E')
                        return res * Math.pow(10, nextInt());
                    if (c < '0' || c > '9')
                        throw new InputMismatchException();
                    m /= 10;
                    res += (c - '0') * m;
                    c = read();
                }
            }
            return res * sgn;
        }
        
        public String readString() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } 
            while (!isSpaceChar(c));
            
            return res.toString();
        }
     
        public boolean isSpaceChar(int c) {
            if (filter != null)
                return filter.isSpaceChar(c);
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }
     
        public String next() {
            return readString();
        }
        
        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);
        }
    }
	public static int min(int a,int b)
	{
		if(a>b)
		{
			return b;
		}
		return a;
	}
	static class pair
	{
		int i;
		int j;
		pair(int i,int j)
		{
			this.i = i;
			this.j = j;
		}
	}
	public static void main(String args[]) throws Exception {
        new Thread(null, new solution(),"Main",1<<26).start();
    }
	public void run() {
        InputReader sc  = new InputReader(System.in);
		PrintWriter out = new PrintWriter(System.out);
		int n = sc.nextInt();
		int d = sc.nextInt();
		int k = sc.nextInt();
		if(n==1)
		{
			out.println("NO");
			out.close();
			return;
		}
		else if(n==2&&d!=1)
		{
			out.println("NO");
			out.close();
			return;
		}
		else if(n!=2&&d==1)
		{
			out.println("NO");
			out.close();
			return;
		}
		else if(n==2&&d==1)
		{
			out.println("YES");
			out.println(1+" "+2);
			out.close();
			return;
		}
		else if(k==1)
		{
			out.println("NO");
			out.close();
			return;
		}
		ArrayList<pair> ans = new ArrayList<>();
		Stack<Integer> s = new Stack<>();
		int node = 3;
		ans.add(new pair(1,2));
		ans.add(new pair(1,3));
		s.push(node);
		d-=2;
		while(d!=0&&node<n)
		{
			ans.add(new pair(node,node+1));
			node++;
			d--;
			s.push(node);
		}
		if(d!=0)
		{
			out.println("NO");
		}
		else
		{
			s.pop();
			node++;
			while(s.size()!=0&&node<=n)
			{
				int ind = s.pop();
				for(int i=0;i<k-2&&node<=n;i++)
				{
					ans.add(new pair(ind,node));
					node++;
				}
			}
			for(int i=0;i<k-2&&node<=n;i++)
			{
				ans.add(new pair(1,node));
				node++;
			}
			if(node<=n)
			{
				out.println("NO");
			}
			else
			{
				out.println("YES");
				for(pair x:ans)
				{
					out.println(x.i+" "+x.j);
				}
			}
		}
		out.close();
    }
}