#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 7;
int q[2 * N], grad[N], numext[N];
vector<pair<int, int> > ans;
int main() {
  int n, d, k;
  cin >> n >> d >> k;
  if (d >= n) {
    cout << "NO";
    return 0;
  }
  for (int i = 0; i < d; ++i) {
    ans.push_back(make_pair(n - i, n - i - 1));
    ++grad[n - i];
    ++grad[n - i - 1];
    if (grad[n - i] > k) {
      cout << "NO";
      return 0;
    }
  }
  int st(0), dr(-1);
  for (int i = n - d; i <= n; ++i) {
    numext[i] = min(n - i, i - n + d);
    if (grad[i] < k && numext[i]) {
      q[++dr] = i;
    }
  }
  n -= d + 1;
  while (st <= dr && n) {
    int x = q[st++];
    ++grad[x];
    ++grad[n];
    numext[n] = numext[x] - 1;
    if (grad[n] < k && numext[n] && dr - st + 1 < n - 1) {
      q[++dr] = n;
    }
    ans.push_back(make_pair(x, n--));
    if (grad[x] < k && dr - st + 1 < n) {
      q[++dr] = x;
    }
  }
  if (n) {
    cout << "NO";
    return 0;
  }
  cout << "YES\n";
  for (size_t i = 0; i < ans.size(); ++i) {
    cout << ans[i].first << ' ' << ans[i].second << '\n';
  }
  return 0;
}
