#include <bits/stdc++.h>

using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

class rep {
    struct Iter {
        usize itr;
        constexpr Iter(const usize pos) noexcept : itr(pos) {}
        constexpr void operator++() noexcept { ++itr; }
        constexpr bool operator!=(const Iter& other) const noexcept { return itr != other.itr; }
        constexpr usize operator*() const noexcept { return itr; }
    };
    const Iter first, last;

  public:
    explicit constexpr rep(const usize first, const usize last) noexcept : first(first), last(std::max(first, last)) {}
    constexpr Iter begin() const noexcept { return first; }
    constexpr Iter end() const noexcept { return last; }
};

template <class T> using Vec = std::vector<T>;

void main_() {
    usize N;
    u64 K, M;
    std::cin >> N >> M >> K;
    // 和を M にするのと転倒数を K にするのは別問題
    // 0, 1, ..., 最後だけ適当
    Vec<u64> num(N);
    for (const auto i : rep(0, N - 1)) {
        num[i] = i;
    }
    num[N - 1] = M - (u64)(N - 1) * (N - 2) / 2;
    Vec<u64> ans;
    while (K > 0) {
        if (K < num.size()) {
            ans.push_back(num[K]);
            num.erase(num.begin() + K);
            K = 0;
        } else {
            ans.push_back(num.back());
            num.pop_back();
            K -= num.size();
        }
    }
    std::copy(num.begin(), num.end(), std::back_inserter(ans));
    for (const auto i : rep(0, N)) {
        std::cout << ans[i] << '\n';
    }
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    main_();
    return 0;
}