#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXN = 4 * (1e5 + 10);
int grau[MAXN], forb[MAXN], qForb[MAXN];
int n, nV, d, k, fim, id[MAXN];
vector<pair<int, int> > tree;
void create_Edge(int u, int v) {
  if (forb[u] or forb[v]) return;
  tree.push_back({u, v});
  grau[u]++, grau[v]++;
  if (qForb[u]) forb[v] = 1;
  int idTemp = u > ceil(fim / 2) ? fim - u : u - 1;
  if (u >= 1 && u <= fim && idTemp == 1) forb[v] = 1;
}
bool build(int v, int s) {
  int davez = v;
  for (int i = 1; i <= s; i++) {
    if (nV == n) return 0;
    create_Edge(davez, ++nV), davez = nV;
    id[nV] = i > ceil(s / 2) ? s - i : i - 1;
    if (i == s)
      forb[nV] = 1;
    else if (i == s - 1)
      qForb[nV] = 1;
  }
  return 1;
}
int main() {
  scanf("%d %d %d", &n, &d, &k);
  if (n < d + 1) {
    puts("NO");
    return 0;
  }
  memset(id, -1, sizeof id), memset(grau, 0, sizeof grau),
      memset(forb, 0, sizeof forb), memset(qForb, 0, sizeof qForb);
  for (int i = 1; i <= d; i++) create_Edge(i, i + 1);
  if (k <= 2 && d + 1 != n) {
    puts("NO");
    return 0;
  }
  nV = d + 1, fim = nV;
  for (int i = 2; i < fim; i++)
    if (!build(i, (i > ceil(fim / 2) ? fim - i : i - 1))) goto out;
  for (int i = fim; i <= nV; i++) build(i, id[i]);
  forb[1] = 1, forb[fim] = 1;
  for (int i = 1; i <= nV; i++) {
    if (forb[i]) continue;
    int g = grau[i];
    for (int x = g; x < k; x++) {
      if (nV == n) goto out;
      create_Edge(i, ++nV);
    }
  }
  if (nV != n) {
    puts("NO");
    return 0;
  }
out:
  puts("YES");
  for (int i = 0; i < tree.size(); i++)
    printf("%d %d\n", tree[i].first, tree[i].second);
}
