#include <bits/stdc++.h>
int faster_in() {
  int r = 0, c;
  for (c = getchar(); c <= 32; c = getchar())
    ;
  if (c == '-') return -faster_in();
  for (; c > 32; r = (r << 1) + (r << 3) + c - '0', c = getchar())
    ;
  return r;
}
using namespace std;
const int INF = int(1e9 + 7);
queue<pair<int, int> > edges;
int deg[400010], totNodes, n, d, k;
void addEdge(int v, int dist) {
  if (deg[v] == k || totNodes == n || dist == d) return;
  while (totNodes < n && deg[v] < k) {
    deg[v]++;
    totNodes++;
    edges.push(make_pair(v, totNodes));
    deg[totNodes] = 1;
    addEdge(totNodes, dist + 1);
  }
}
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> d >> k;
  if (d >= n || (d > 0 && k < 2 && n > 2) || d >= n) {
    cout << "NO" << '\n';
    return 0;
  }
  if (n == 1) {
    return 0;
  }
  for (int i = 1; i <= d; i++) {
    edges.push(make_pair(i, i + 1));
  }
  totNodes = d + 1;
  for (int i = 2; i <= d; i++) {
    deg[i] = 2;
  }
  for (int i = 2; i <= d; i++) {
    addEdge(i, max(d - i + 1, i - 1));
  }
  if (edges.size() < n - 1) {
    cout << "NO" << '\n';
    return 0;
  }
  cout << "YES" << '\n';
  while (!edges.empty()) {
    cout << edges.front().first << ' ' << edges.front().second << '\n';
    edges.pop();
  }
  return 0;
}
