#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++(i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++(i))
#define REP_R(i, n) for (int i = (int)(n)-1; (i) >= 0; --(i))
#define REP3R(i, m, n) for (int i = (int)(n)-1; (i) >= (int)(m); --(i))
#define ALL(x) ::std::begin(x), ::std::end(x)
using namespace std;

vector<int64_t> solve(int n, int64_t m, int64_t k) {
    vector<int64_t> a(n);
    REP (i, n) {
        a[i] = i;
    }
    a.back() += m - accumulate(ALL(a), 0ll);

    vector<int> b;
    set<int> available;
    REP (i, n) {
        available.insert(i);
    }
    REP (i, n) {
        set<int>::iterator it;
        if (k < available.size()) {
            it = available.begin();
            REP (j, k) {
                it = next(it);
            }
            k = 0;
        } else {
            it = prev(available.end());
            k -= available.size() - 1;
        }
        b.push_back(*it);
        available.erase(it);
    }

    vector<int64_t> c(n);
    REP (i, n) {
        c[i] = a[b[i]];
    }
    return c;
}

// generated by oj-template v4.8.0 (https://github.com/online-judge-tools/template-generator)
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int64_t N, M, K;
    std::cin >> N >> M >> K;
    auto ans = solve(N, M, K);
    REP (i, N) { std::cout << ans[i] << '\n'; }
    return 0;
}