#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y) {
  if (y == 0)
    return 1;
  else if (y % 2 == 0)
    return (power(x, y / 2) * power(x, y / 2)) % 998244353;
  else
    return ((x * power(x, y / 2)) % 998244353 * power(x, y / 2)) % 998244353;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, d, k, i, x;
  queue<long long> q;
  cin >> n >> d >> k;
  if (n <= d) {
    cout << "NO";
    return 0;
  }
  vector<pair<long long, long long> > v;
  vector<long long> dist(n + 1, 0), deg(n + 1, 0);
  dist[1] = d;
  for (i = 1; i <= d; i++) {
    v.push_back({i, i + 1});
    deg[i]++;
    deg[i + 1]++;
    if (deg[i] > k || deg[i + 1] > k) {
      cout << "NO";
      return 0;
    }
    dist[i + 1] = max(i, d - i);
    q.push(i);
  }
  q.pop();
  for (i = d + 2; i <= n; i++) {
    if (q.empty()) {
      cout << "NO";
      return 0;
    }
    x = q.front();
    if (deg[x] >= k || dist[x] >= d || deg[i] + 1 > k) {
      cout << "NO";
      return 0;
    }
    deg[x]++;
    deg[i]++;
    dist[i] = dist[x] + 1;
    if (deg[x] >= k) {
      q.pop();
    }
    v.push_back({i, x});
    if (dist[i] < d) {
      q.push(i);
    }
  }
  cout << "YES" << endl;
  for (auto it : v) {
    cout << it.first << " " << it.second << endl;
  }
  cerr << (1000 * clock()) / CLOCKS_PER_SEC << "ms";
  return 0;
}
