#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 9;
int n, d, c;
vector<int> G[N];
vector<int> nod[N];
vector<pair<int, int>> ans;
bool solve(vector<int> &a) {
  int m = a.size();
  if (m == 0) return false;
  if (d & 1) {
    if (m / 2 <= d / 2) return false;
    assert(m % 2 == 0);
    for (int i = 0; i < m; i++) {
      for (int j = 1; j <= d / 2; j++) {
        ans.emplace_back(a[i], a[(i + j) % m]);
      }
    }
    for (int i = 0; i < m / 2; i++) {
      ans.emplace_back(a[i], a[i + m / 2]);
    }
  } else {
    if (m <= d) {
      return false;
    }
    for (int i = 0; i < m; i++) {
      for (int j = 1; j <= d / 2; j++) {
        ans.emplace_back(a[i], a[(i + j) % m]);
      }
    }
  }
  return true;
}
bool solve() {
  if (d == 0) {
    return n == c;
  } else if (d == 1) {
    if (n % 2 == 0 && n / 2 == c) {
      for (int i = 1; i <= n; i += 2) {
        ans.emplace_back(i, i + 1);
      }
      return true;
    } else {
      return false;
    }
  }
  if (n % 2 == 1 && d % 2 == 1) {
    return false;
  }
  int m = n / c, tot = 0;
  if (d % 2 == 0) {
    for (int i = 1; i <= n % c; i++) {
      nod[i].push_back(++tot);
    }
  } else {
    m = (m >> 1) << 1;
    for (int i = 1; i <= (n - m * c) / 2; i++) {
      nod[i].push_back(++tot);
      nod[i].push_back(++tot);
    }
  }
  for (int i = 1; i <= c; i++) {
    for (int j = 1; j <= m; j++) nod[i].push_back(++tot);
  }
  assert(tot == n);
  for (int i = 1; i <= c; i++)
    if (!solve(nod[i])) {
      return false;
    }
  return true;
}
int main() {
#ifdef memset0
  freopen("F.in", "r", stdin);
#endif
  cin.tie(0)->sync_with_stdio(0);
  cin >> n >> d >> c;
  bool found = solve();
  if (found) {
    cout << "Yes" << endl;
    for (const auto &[u, v] : ans) {
      // cout << u << ' ' << v << '\n';
      G[u].push_back(v);
      G[v].push_back(u);
    }
    for (int i = 1; i <= n; i++) {
      sort(G[i].begin(), G[i].end());
      for (int x : G[i]) cout << x << ' ';
      cout << '\n';
      assert(G[i].size() == d);
      for (int j = 1; j < G[i].size(); j++) assert(G[i][j] != G[i][j - 1]);
    }
  } else {
    cout << "No" << endl;
  }
}