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

public class Mainn {
	FastReader scn;
	PrintWriter out;
	String INPUT = "";

	int curr;

	void solve() {
		int n = scn.nextInt(), d = scn.nextInt(), k = scn.nextInt();
		if (d >= n || (k == 1 && d > 1)) {
			out.println("NO");
			return;
		}
		ArrayList<Integer>[] tree = new ArrayList[n];
		Arrays.setAll(tree, i -> new ArrayList<>());
		int[] len = new int[d + 1];
		for (int i = 0, j = d; i < d; i++, j--) {
			int u = i, v = i + 1;
			tree[u].add(v);
			tree[v].add(u);
			len[i] = Math.min(i, j);
		}

		curr = d + 1;
		for (int i = 1; i < d; i++) {
			add(k, len[i], tree, n, i);
			if (curr == n) {
				break;
			}
		}

		if (curr != n) {
			out.println("NO");
			return;
		}

		TreeSet<String> ans = new TreeSet<>();
		for (int i = 0; i < n; i++) {
			for (int j : tree[i]) {
				int u = i + 1, v = j + 1;
				if (u < v) {
					ans.add(u + " " + v);
				} else {
					ans.add(v + " " + u);
				}
			}
		}

		out.println("YES");
		for (String s : ans) {
			out.println(s);
		}
	}

	void add(int k, int len, ArrayList<Integer>[] tree, int n, int i) {
		if(len == 0) {
			return;
		}
		while(tree[i].size() < k && curr < n) {
			tree[i].add(curr);
			tree[curr].add(i);
			curr++;
			add(k, len - 1, tree, n, curr - 1);
		}
	}

	void run() throws Exception {
		boolean oj = System.getProperty("ONLINE_JUDGE") != null;
		out = new PrintWriter(System.out);
		scn = new FastReader(oj);
		long time = System.currentTimeMillis();
		solve();
		out.flush();
		if (!oj) {
			System.out.println(Arrays.deepToString(new Object[] { System.currentTimeMillis() - time + " ms" }));
		}
	}

	public static void main(String[] args) throws Exception {
		new Mainn().run();
	}

	class FastReader {
		InputStream is;

		public FastReader(boolean onlineJudge) {
			is = onlineJudge ? System.in : new ByteArrayInputStream(INPUT.getBytes());

		}

		byte[] inbuf = new byte[1024];
		public int lenbuf = 0, ptrbuf = 0;

		int readByte() {
			if (lenbuf == -1)
				throw new InputMismatchException();
			if (ptrbuf >= lenbuf) {
				ptrbuf = 0;
				try {
					lenbuf = is.read(inbuf);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (lenbuf <= 0)
					return -1;
			}
			return inbuf[ptrbuf++];
		}

		boolean isSpaceChar(int c) {
			return !(c >= 33 && c <= 126);
		}

		int skip() {
			int b;
			while ((b = readByte()) != -1 && isSpaceChar(b))
				;
			return b;
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		char nextChar() {
			return (char) skip();
		}

		String next() {
			int b = skip();
			StringBuilder sb = new StringBuilder();
			while (!(isSpaceChar(b))) { // when nextLine, (isSpaceChar(b) && b != ' ')
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}

		char[] next(int n) {
			char[] buf = new char[n];
			int b = skip(), p = 0;
			while (p < n && !(isSpaceChar(b))) {
				buf[p++] = (char) b;
				b = readByte();
			}
			return n == p ? buf : Arrays.copyOf(buf, p);
		}

		char[][] nextMatrix(int n, int m) {
			char[][] map = new char[n][];
			for (int i = 0; i < n; i++)
				map[i] = next(m);
			return map;
		}

		int[] nextArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}

		long[] nextLongArray(int n) {
			long[] a = new long[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}

		int nextInt() {
			int num = 0, b;
			boolean minus = false;
			while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))
				;
			if (b == '-') {
				minus = true;
				b = readByte();
			}

			while (true) {
				if (b >= '0' && b <= '9') {
					num = num * 10 + (b - '0');
				} else {
					return minus ? -num : num;
				}
				b = readByte();
			}
		}

		long nextLong() {
			long num = 0;
			int b;
			boolean minus = false;
			while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))
				;
			if (b == '-') {
				minus = true;
				b = readByte();
			}

			while (true) {
				if (b >= '0' && b <= '9') {
					num = num * 10 + (b - '0');
				} else {
					return minus ? -num : num;
				}
				b = readByte();
			}
		}

		int[] shuffle(int[] arr) {
			Random r = new Random();
			for (int i = 1, j; i < arr.length; i++) {
				j = r.nextInt(i);
				arr[i] = arr[i] ^ arr[j];
				arr[j] = arr[i] ^ arr[j];
				arr[i] = arr[i] ^ arr[j];
			}
			return arr;
		}
	}
}