#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
priority_queue<int, vector<int>, greater<int> > pq;
struct node {
  int first, secont, nnn;
};
vector<pair<int, int> > v;
queue<node> ma;
deque<int> dq;
int main() {
  int n, d, k, num = 0;
  scanf("%d %d %d", &n, &d, &k);
  if (n == 1) return !printf("NO");
  if (d == 1 || k == 1) {
    if (n == 2 && d == 1) {
      printf("YES\n");
      printf("1 2");
      return 0;
    }
    return !printf("NO");
  }
  if (d >= n) return !printf("NO");
  for (int i = 1; i <= d + 1; i++) {
    ma.push({min((d + 1) - i, i - 1), k - 2, ++num});
    if (i != 1) v.push_back({num - 1, num});
  }
  n -= num;
  int flag = 0;
  if (n == 0) flag = 1;
  node tv;
  while (!ma.empty() && n) {
    tv = ma.front();
    if (tv.first == 0 || tv.secont == 0) {
      ma.pop();
      continue;
    }
    v.push_back({tv.nnn, ++num});
    ma.push({tv.first - 1, k - 1, num});
    ma.push({tv.first, tv.secont - 1, tv.nnn});
    ma.pop();
    n--;
    if (n == 0) {
      flag = 1;
      break;
    }
  }
  if (!flag)
    return !printf("NO");
  else {
    printf("YES\n");
    for (int i = 0; i < (int)(v).size(); i++)
      printf("%d %d\n", v[i].first, v[i].second);
  }
}
