import java.io.*;
import java.util.*;
import static java.lang.Math.*;

public class E{
	
	static int n,d,k;
	static int[] adj;
	static int[] dist;
	static int used = 0;
	
	static void dfs(int i, int len) {
		if (used-1 == n) return;
		if (d == len) return;
		while (adj[i] < k) {
			if (used-1==n) return;
			edges.add(i + " " + used);
			adj[i]++;
			dfs(used, dist[used++] = len+1);
		}
	}
	static List<String> edges;
	public static void main(String[] args) throws IOException {
		// br = new BufferedReader(new FileReader(".in"));
		// out = new PrintWriter(new FileWriter(".out"));
		//new Thread(null, new (), "peepee", 1<<28).start();
		
		n =readInt();
		adj = new int[n+10];
		dist = new int[n+10];
		d =readInt();
		k =readInt();
		edges = new ArrayList<String>();
		for (int i = 1; i <= d; i++) {
			edges.add(i + " " + (i+1));
		}
		adj[1] = 1;
		adj[d+1] = 1;
		for (int i =2; i <= d; i++) adj[i] = 2;
		used =d+2;
		for (int i = 1; i<= d+1; i++) {
			dist[i] = max(i-1, d+1-i);
		}
		for (int i =1; i <= d+1; i++) dfs(i,dist[i]);
		
		// Solution is clear but also hell to implement
		//System.out.println(used);
		if (used-1 != n) {
			out.println("NO");
		}
		else {
			out.println("YES");
			for (String s: edges) out.println(s);
		}
		
		out.close();
	}
	
	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
	static StringTokenizer st = new StringTokenizer("");
	static String read() throws IOException{return st.hasMoreTokens() ? st.nextToken():(st = new StringTokenizer(br.readLine())).nextToken();}
	static int readInt() throws IOException{return Integer.parseInt(read());}
	static long readLong() throws IOException{return Long.parseLong(read());}
	static double readDouble() throws IOException{return Double.parseDouble(read());}
}