#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

// 残す方
// K <= M
// 距離を定めて、同じ距離には辺を張れない？
// よくわかないので DP

void Solve() {
  int n, m, K;
  IN(n, m, K);

  m = n * (n - 1) / 2 - m;

  vector f(K + 2, vector(n + 1, vector<int>(n + 1, -INF)));
  f[0][0][0] = 0;

  for (int k : Rep(0, K + 1)) {
    for (int s : Rep1(0, n))
      for (int l : Rep(0, n)) {
        if (f[k][s][l] < 0)
          continue;
        for (int x : Rep1(1, n - s))
          SetMax(f[k + 1][s + x][x], f[k][s][l] + l * x + x * (x - 1) / 2);
      }
  }

  if (m < K || m > f[K + 1][n][1]) {
    OUT("No");
    return;
  }
  OUT("Yes");

  int len = 1;
  vector<int> d(n, -1);
  int cur_d = 0;
  int k = K + 1;
  for (int l = 0; l < n;) {
    ranges::fill(d | views::drop(l) | views::take(len), cur_d);
    for (int x : Rep1(0, n - l)) {
      if (f[k][n - l][len] == f[k - 1][n - l - len][x] + x * len + len * (len - 1) / 2) {
        l += len;
        len = x;
        break;
      }
      if (x == n - l)
        assert(false);
    }
    ++cur_d;
    --k;
  }

  vector<int> v{n - 1};
  for (int i : Rev(Rep(0, n - 1)))
    if (d[i] < d[i + 1])
      v.push_back(i);
  ranges::reverse(v);

  vector g(n, vector<bool>(n));

  for (int vi : Rep(0, Len(v) - 1)) {
    int i = v[vi];
    int j = v[vi + 1];
    g[i][j] = true;
    --m;
  }

  for (int i : Rep(0, n))
    for (int j : Rep(i + 1, n))
      if (!g[i][j] && d[j] <= d[i] + 1)
        if (m > 0) {
          --m;
          g[i][j] = true;
        }

  for (int i : Rep(0, n))
    for (int j : Rep(i + 1, n))
      if (!g[i][j])
        OUT(OneBased(i, j));
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  Solve();
}

#elif __INCLUDE_LEVEL__ == 1

#include <bits/stdc++.h>

template <class T>
concept MyRange =
    std::ranges::range<T> &&
    !std::convertible_to<T, std::string_view> &&
    !std::convertible_to<T, std::filesystem::path>;

template <class T>
concept MyTuple = std::__is_tuple_like<T>::value && !MyRange<T>;

namespace std {

istream& operator>>(istream& is, MyRange auto&& r) {
  for (auto&& e : r) {
    is >> e;
  }
  return is;
}

istream& operator>>(istream& is, MyTuple auto&& t) {
  apply([&](auto&... xs) { (is >> ... >> xs); }, t);
  return is;
}

ostream& operator<<(ostream& os, MyRange auto&& r) {
  auto sep = "";
  for (auto&& e : r) {
    os << exchange(sep, " ") << forward<decltype(e)>(e);
  }
  return os;
}

ostream& operator<<(ostream& os, MyTuple auto&& t) {
  auto sep = "";
  apply([&](auto&... xs) { ((os << exchange(sep, " ") << xs), ...); }, t);
  return os;
}

}  // namespace std

template <class T>
class OneBased {
 public:
  explicit OneBased(T&& x) : ref_(std::forward<T>(x)) {}

  template <class... Ts>
  requires(sizeof...(Ts) > 1)
      OneBased(Ts&&... xs) : ref_(std::forward_as_tuple(std::forward<Ts>(xs)...)) {}

  friend std::istream& operator>>(std::istream& is, OneBased x) {
    if constexpr (MyRange<T>) {
      for (auto&& e : x.ref_) {
        is >> ::OneBased(e);
      }
    } else if constexpr (MyTuple<T>) {
      std::apply([&](auto&... xs) { (is >> ... >> ::OneBased(xs)); }, x.ref_);
    } else {
      is >> x.ref_;
      --x.ref_;
    }
    return is;
  }

  friend std::ostream& operator<<(std::ostream& os, OneBased x) {
    if constexpr (MyRange<T>) {
      auto f = [](auto&& e) { return ::OneBased(std::forward<decltype(e)>(e)); };
      os << (x.ref_ | std::views::transform(f));
    } else if constexpr (MyTuple<T>) {
      std::apply([&](auto&... xs) { os << std::tuple(::OneBased(xs)...); }, x.ref_);
    } else {
      os << ++x.ref_;
      --x.ref_;
    }
    return os;
  }

 private:
  T ref_;
};

template <class T>
OneBased(T&&) -> OneBased<T>;

template <class... Ts>
OneBased(Ts&&...) -> OneBased<std::tuple<Ts...>>;

using namespace std;

#define LAMBDA2(x, y, ...) ([&](auto&& x, auto&& y) -> decltype(auto) { return __VA_ARGS__; })
#define Rev views::reverse
#define Rep(...) [](int l, int r) { return views::iota(min(l, r), r); }(__VA_ARGS__)
#define Rep1(...) [](int l, int r) { return Rep(l, r + 1); }(__VA_ARGS__)
#define Len(r) int(size(r))
#define SetMax(...) LAMBDA2(x, y, x < y && (x = y, 1))(__VA_ARGS__)
#define INF (INT_MAX / 2)
#define IN(...) (cin >> forward_as_tuple(__VA_ARGS__))
#define OUT(...) (cout << forward_as_tuple(__VA_ARGS__) << '\n')

#endif  // __INCLUDE_LEVEL__ == 1