#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <typename T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <typename T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <typename T>
inline void println(T first) {
  print(first), putchar('\n');
}
template <typename T>
inline void printsp(T first) {
  print(first), putchar(' ');
}
template <class T, class T1>
inline void print(T first, T1 second) {
  printsp(first), println(second);
}
template <class T, class T1, class T2>
inline void print(T first, T1 second, T2 z) {
  printsp(first), printsp(second), println(z);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
vector<int> adj[444444];
int child[444444];
int main() {
  int n, dd, k;
  gn(n, dd, k);
  if (n == 1 or n <= dd) return puts("NO"), 0;
  if (k == 1) {
    if (n == 2) {
      if (dd == 1) {
        puts("YES");
        puts("1 2");
        return 0;
      }
    }
    return puts("NO"), 0;
  }
  for (int i = 1; i <= dd + 1; i++) child[i] = min(i - 1, dd - i + 1);
  for (int i = dd + 2; i <= n; i++) child[i] = 0x3f3f3f3f;
  for (int i = 1; i <= dd; i++) adj[i].push_back(i + 1);
  int cur = dd + 2;
  for (int i = 2; i <= n; i++) {
    if (cur > n) break;
    if (child[i] == 0) continue;
    if (child[i] == 0x3f3f3f3f) return puts("NO"), 0;
    if (i <= dd) {
      for (int j = 0; j < k - 2; j++) {
        if (cur > n) break;
        child[cur] = child[i] - 1;
        adj[i].push_back(cur);
        cur++;
      }
    } else {
      for (int j = 0; j < k - 1; j++) {
        if (cur > n) break;
        child[cur] = child[i] - 1;
        adj[i].push_back(cur);
        cur++;
      }
    }
  }
  puts("YES");
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < adj[i].size(); j++) print(i, adj[i][j]);
  }
  return 0;
}
