#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 <class 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 <class 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 <class T>
inline void printsp(T first) {
  print(first);
  putchar(' ');
}
template <class T>
inline void println(T first) {
  print(first);
  putchar('\n');
}
template <class T, class U>
inline void print(T first, U second) {
  printsp(first);
  println(second);
}
template <class T, class U, class V>
inline void print(T first, U second, V 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[400040];
int dep[400040];
int main() {
  int n, d, k;
  gn(n, d, k);
  if (n <= d) {
    puts("NO");
    return 0;
  }
  if (n == 1) {
    puts("YES");
  }
  if (n == 2) {
    if (d > 1) {
      puts("NO");
      return 0;
    }
    puts("YES");
    puts("1 2");
    return 0;
  }
  if (k == 1) {
    puts("NO");
    return 0;
  }
  for (int i = 1; i <= d; i++) adj[i].push_back(i + 1);
  for (int i = 1; i <= d + 1; i++) dep[i] = min(i - 1, d + 1 - i);
  for (int i = d + 2; i <= n; i++) dep[i] = 0x3f3f3f3f;
  int p = d + 2;
  for (int i = 1; i <= n; i++) {
    if (dep[i] == 0) continue;
    if (dep[i] == 0x3f3f3f3f) {
      puts("NO");
      return 0;
    }
    for (int j = 0; j < k - 1 - (i <= d + 1); j++) {
      dep[p] = dep[i] - 1;
      adj[i].push_back(p);
      p++;
      if (p > n) break;
    }
    if (p > n) break;
  }
  puts("YES");
  for (int i = 1; i <= n; i++)
    for (int j = 0; j < adj[i].size(); j++) printf("%d %d\n", i, adj[i][j]);
  return 0;
}
