#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 400048;
vector<int> v[MAX_N];
vector<pair<int, int> > ans;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, d, k;
  cin >> n >> d >> k;
  int edges = d;
  if (n > 2 && k == 1 || d > n - 1) {
    cout << "NO" << endl;
    return 0;
  }
  queue<pair<int, int> > q;
  for (int i = 1; i <= d; i++) {
    v[i].push_back(i + 1);
    v[i + 1].push_back(i);
    ans.push_back(make_pair(i, i + 1));
    if (i - 1 > 0 && (d + 1) - i > 0)
      q.push(make_pair(i, max(i - 1, (d + 1) - i)));
  }
  while (edges < n - 1 && !q.empty()) {
    pair<int, int> cur = q.front();
    int p = k - v[cur.first].size();
    if (p < 0) {
      cout << "NO" << endl;
      return 0;
    }
    for (int i = 0; i < p && edges < n - 1; i++) {
      edges++;
      v[cur.first].push_back(edges + 1);
      v[edges + 1].push_back(cur.first);
      ans.push_back(make_pair(cur.first, edges + 1));
      if (cur.second + 1 < d) {
        q.push(make_pair(edges + 1, cur.second + 1));
      }
    }
    q.pop();
  }
  if (edges < n - 1) {
    cout << "NO" << endl;
    return 0;
  }
  cout << "YES" << endl;
  for (int i = 0; i < n - 1; i++) {
    cout << ans[i].first << " " << ans[i].second << endl;
  }
  return 0;
}
