#include <bits/stdc++.h>
using namespace std;
long long Mod(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
class Triplet {
 public:
  long long x;
  long long y;
  long long gcd;
};
Triplet extendedEuclid(long long a, long long b) {
  if (b == 0) {
    Triplet ans;
    ans.gcd = a;
    ans.x = 1;
    ans.y = 0;
    return ans;
  }
  Triplet smallAns = extendedEuclid(b, a % b);
  Triplet ans;
  ans.gcd = smallAns.gcd;
  ans.x = smallAns.y;
  ans.y = smallAns.x - (a / b) * smallAns.y;
  return ans;
}
long long mmInverse(long long a, long long m) {
  Triplet ans = extendedEuclid(a, m);
  return ans.x;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n, dia, k;
  cin >> n >> dia >> k;
  if (dia >= n) {
    cout << "NO" << endl;
    return 0;
  }
  set<pair<long long, long long> > st;
  vector<pair<long long, long long> > tree;
  long long indegree[400005];
  for (long long i = 0; i < n; i++) indegree[i] = 0;
  for (long long i = 0; i < dia; i++) {
    indegree[i]++;
    indegree[i + 1]++;
    tree.push_back({i, i + 1});
  }
  for (long long i = 0; i <= dia; i++) {
    if (indegree[i] > k) {
      cout << "NO" << endl;
      return 0;
    }
  }
  for (long long i = 1; i < dia; i++) {
    st.insert({max(i, dia - i), i});
  }
  for (long long i = dia + 1; i < n; i++) {
    if (st.empty()) {
      cout << "NO" << endl;
      return 0;
    }
    auto it = st.begin();
    long long maxv = it->first;
    long long vert = it->second;
    if (maxv >= dia) {
      cout << "NO" << endl;
      return 0;
    }
    while (!st.empty() && indegree[vert] >= k) {
      st.erase(st.begin());
      it = st.begin();
      vert = it->second;
    }
    if (st.empty()) {
      cout << "NO" << endl;
      return 0;
    }
    maxv = it->first;
    if (maxv >= dia) {
      cout << "NO" << endl;
      return 0;
    }
    vert = st.begin()->second;
    indegree[vert]++;
    indegree[i]++;
    tree.push_back({i, vert});
    st.insert({maxv + 1, i});
  }
  cout << "YES" << endl;
  for (auto it : tree) {
    cout << it.first + 1 << " " << it.second + 1 << endl;
  }
}
