#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-ffloat-store")
#pragma GCC optimize("-fno-defer-pop")
long long dx[4] = {-1, 0, 0, +1};
long long dy[4] = {0, -1, +1, 0};
const long long LINF = 1e18;
const long long INF = 1e9;
const long long MOD = 1e9 + 7;
long long strtoll(string s) {
  stringstream str(s);
  long long number = 0;
  str >> number;
  return number;
}
string lltostr(long long n) {
  stringstream ss;
  ss << n;
  return ss.str();
}
long long llsqrt(long long x) {
  if (x == 0 || x == 1) return x;
  long long start = 1, end = x / 2, ans;
  while (start <= end) {
    long long mid = (start + end) / 2;
    if (mid * mid == x)
      return mid;
    else if (mid <= x / mid)
      ans = mid, start = mid + 1;
    else
      end = mid - 1;
  }
  return ans;
}
vector<long long> spf;
void sieve(long long size) {
  spf.resize(size + 1);
  for (long long i = 1; i <= size; ++i) spf[i] = i;
  for (long long i = 4; i <= size; i += 2) spf[i] = 2;
  for (long long i = 3; i * i <= size; ++i) {
    if (spf[i] == i) {
      for (long long j = i * i; j <= size; j += i)
        if (spf[j] == j) spf[j] = i;
    }
  }
}
long long power(long long a, long long b, long long m) {
  if (b == 0) return 1;
  if (b == 1) return a % m;
  long long t = power(a, b / 2, m);
  t = (t * t) % m;
  if (b & 1) t = (t * a) % m;
  return t;
}
long long modInverse(long long a, long long m) { return power(a, m - 2, m); }
void fastscan(long long &number) {
  bool negative = false;
  register long long c;
  number = 0;
  c = getchar();
  if (c == '-') {
    negative = true;
    c = getchar();
  }
  for (; (c > 47 && c < 58); c = getchar()) number = number * 10 + c - 48;
  if (negative) number *= -1;
}
long long solve() {
  long long n, d, k;
  cin >> n >> d >> k;
  d++;
  if (k == 1) {
    if (d == 2 && n == 2) {
      cout << "YES" << endl;
      cout << "1 2" << endl;
      return 0;
    } else {
      cout << "NO";
      return 0;
    }
  }
  queue<pair<long long, pair<long long, long long> > > q;
  vector<pair<long long, long long> > v;
  for (long long i = 1; i <= d; i++) {
    long long x = i - 1;
    long long y = d - i;
    long long z = min(x, y);
    long long dg;
    if (i == 1 || i == d)
      dg = 1;
    else
      dg = 2;
    q.push({i, {k - dg, z}});
  }
  for (long long i = 1; i < d; i++) v.push_back({i, i + 1});
  long long b = d + 1;
  while (1) {
    if (q.size() == 0) break;
    if (v.size() >= n - 1) break;
    pair<long long, pair<long long, long long> > pp = q.front();
    q.pop();
    if (pp.second.first < 0 || pp.second.second < 0) {
      cout << "NO";
      return 0;
    }
    if (pp.second.first == 0 || pp.second.second == 0) {
      continue;
    }
    long long dg = pp.second.first - 1;
    long long l = pp.second.second;
    q.push({pp.first, {dg, l}});
    q.push({b, {k - 1, l - 1}});
    v.push_back({b, pp.first});
    b++;
  }
  if (v.size() == n - 1) {
    cout << "YES" << endl;
    for (long long i = 0; i < v.size(); i++)
      cout << v[i].first << " " << v[i].second << endl;
  } else {
    cout << "NO" << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  solve();
  return 0;
}
