#include <bits/stdc++.h>
using namespace std;
const long long N = 400001;
vector<long long> graph[N];
set<pair<long long, long long> > storeAddOns;
set<pair<long long, long long> > edges;
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long n, d, k;
  cin >> n >> d >> k;
  long long valid = 1;
  if (d >= n) valid = 0;
  if (k == 1 && n > 2)
    valid = 0;
  else {
    long long startVertex = 1;
    long long dia = d;
    while (dia--) {
      graph[startVertex].push_back(startVertex + 1);
      graph[startVertex + 1].push_back(startVertex);
      long long extra = min(startVertex - 1, d + 1 - startVertex);
      pair<long long, long long> a = make_pair(extra, startVertex);
      if (extra > 0) storeAddOns.insert(a);
      startVertex += 1;
    }
    startVertex += 1;
    while (startVertex <= n) {
      if (storeAddOns.size() == 0) break;
      auto topItr = storeAddOns.begin();
      long long minCount = topItr->first;
      long long parentVertex = topItr->second;
      long long degree = graph[parentVertex].size();
      if (degree < k) {
        if (minCount > 0) {
          minCount--;
          graph[parentVertex].push_back(startVertex);
          graph[startVertex].push_back(parentVertex);
          pair<long long, long long> a = make_pair(minCount, startVertex);
          storeAddOns.insert(a);
          startVertex += 1;
        } else if (minCount == 0) {
          storeAddOns.erase(topItr);
        }
      } else if (degree >= k) {
        storeAddOns.erase(topItr);
      }
    }
    if (startVertex != n + 1) valid = 0;
  }
  if (valid == 0) {
    cout << "NO" << endl;
  } else {
    cout << "YES" << endl;
    for (long long i = 1; i <= n; i++) {
      for (long long j = 0; j < graph[i].size(); j++) {
        pair<long long, long long> e = make_pair(i, graph[i][j]);
        pair<long long, long long> f = make_pair(graph[i][j], i);
        auto findItr1 = edges.find(e);
        auto findItr2 = edges.find(f);
        if (findItr1 == edges.end() && findItr2 == edges.end()) {
          cout << i << " " << graph[i][j] << endl;
          edges.insert(e);
          edges.insert(f);
        }
      }
    }
  }
  return 0;
}
