#include <bits/stdc++.h>
using namespace std;
const long long N = 1e6 + 100, OO = 1e8 + 100, M = 998244353, P = 6151,
                sq = 1e3, lg = 60;
long long f[N], dis[N];
int32_t main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  long long n, d, k;
  cin >> n >> d >> k;
  if (k == 1 && n == 2 && d == 1) {
    cout << "YES\n1 2";
    return 0;
  }
  if (k == 1 && n > 1) return cout << "NO", 0;
  vector<pair<long long, long long> > e;
  if (d >= n) return cout << "NO", 0;
  queue<long long> q;
  q.push(1);
  dis[1] = 0;
  f[1] = k - 1;
  for (long long i = 2; i <= d + 1; i++) {
    e.push_back({i - 1, i});
    q.push(i);
    dis[i] = min(abs(i - 1), abs(d + 1 - i));
    if (i <= d)
      f[i] = k - 2;
    else
      f[i] = k - 1;
  }
  d = d + 1;
  while (q.size()) {
    if (d == n) break;
    long long i = q.front();
    q.pop();
    if (dis[i] == 0) continue;
    while (f[i] > 0) {
      f[i]--;
      if (d == n) break;
      q.push(++d);
      f[d] = k - 1;
      dis[d] = dis[i] - 1;
      e.push_back({d, i});
    }
  }
  if (d != n) return cout << "NO", 0;
  cout << "YES" << endl;
  for (auto u : e) cout << u.first << " " << u.second << endl;
  return 0;
}
