#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, d, k;
  cin >> n >> d >> k;
  vector<int> w(n + 1, 0), first(n + 1, 0), v(n + 1, -1);
  queue<int> q;
  q.push(1);
  int maxf = 0, maxs = 0, idf = 0;
  for (int c = 2; c <= n;) {
    if (q.empty()) {
      cout << "NO";
      return 0;
    }
    int x = q.front();
    q.pop();
    for (int j = 0; j < k - 1 + (x == 1) && c <= n; j++, c++) {
      q.push(c);
      w[c] = w[x] + 1;
      v[c] = x;
      first[c] = first[x];
      if (c == 2) first[c] = 1;
      if (first[c]) {
        maxf = w[c];
        idf = c;
      } else
        maxs = w[c];
      if (n - c + maxs + maxf == d && c != n && k != 1) {
        c += 1;
        for (; n - c >= 0; c++) {
          w[c] = w[idf] + 1;
          v[c] = idf;
          idf = c;
          maxf = w[c];
        }
      }
    }
  }
  if (maxf + maxs == d) {
    cout << "YES\n";
    for (int i = 2; i <= n; i++) {
      cout << i << " " << v[i] << "\n";
    }
  } else {
    cout << "NO";
  }
}
