import java.util.*;
import java.io.*;


public final class ProblemE {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());

        int n = Integer.parseInt(st.nextToken());
        int d = Integer.parseInt(st.nextToken());
        int k = Integer.parseInt(st.nextToken());
        Queue<Integer> pq = new LinkedList();
        int[] maxDepth = new int[n];
        Graph g = new Graph(n);
        int c = 0;


        if (n <= d) {
            System.out.println("NO");
            return;
        }

        for (c = 0 ; c < d ; c++) {
            g.addEdge(c, c+1);

            if ( c > d/2) {
                maxDepth[c] = d-c;
            } else {
                maxDepth[c] = c;
            }
            if (g.degree[c] > k) {
                System.out.println("NO");
                return;
            }
        }
        c++;
        for(; c < n ; c++) {
            pq.add(c);
        }

        for (int i = 0 ; i < d ; i++) {
            addChildren(g, i, maxDepth, pq, k);
        }


        if (!pq.isEmpty()) {
            System.out.println("NO");
            return;
        } 
        //System.out.println(g);
        HashSet<String> set = new HashSet();
		StringBuilder print = new StringBuilder("YES\n");
        for (int i = 0 ; i < n ; i++) {
            for (Integer j : g.adj[i]) {
                String t1 = String.format("%d %d", i+1, j+1);
                if (set.contains(t1)) {
                    continue;
                }
                String t2 = String.format("%d %d", j+1, i+1);
                print.append(t1);
                set.add(t1);
                set.add(t2);
            }
        }
        System.out.println(print);
        //System.out.println(Arrays.toString(maxDepth));
    }

    /**
     * returns the number of children added
     * returns -1 if not possible to do it
     */
    public static void addChildren(Graph g, int source, int[] maxDepth, Queue<Integer> nodes, int k) {
        if (maxDepth[source] == 0) {
            return;
        }
        while (g.degree[source] < k && !nodes.isEmpty()) {
            int nextNode = nodes.remove();
            g.addEdge(source, nextNode);
            maxDepth[nextNode] = maxDepth[source] - 1;

            if (maxDepth[nextNode] != 0) {
                addChildren(g, nextNode, maxDepth, nodes, k);
            }
        }
    }

    static class Graph {
        int V;
        LinkedList<Integer>[] adj;
        int[] degree;

        public Graph(int v) {
            this.V = v;
            this.adj = new LinkedList[v];
            for (int i = 0 ; i < v ; i++) {
                this.adj[i] = new LinkedList();
            }
            this.degree = new int[v];
        }

        public void addEdge(int a, int b) {
            this.adj[a].add(b);
            this.adj[b].add(a);
            degree[a]++;
            degree[b]++;
        }

        @Override
        public String toString() {
            String s1 =  Arrays.toString(this.adj);
            String s2 = Arrays.toString(this.degree);
            return s1 + "\n" + s2;
        }

    }
}


