#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using uint = unsigned;
using ull = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    ll n, k, m;
    cin >> n >> m >> k;
    deque<ll> Q;
    for (int i = 0; i < n; ++i) {
        ll val = i;
        m -= i;
        if(i+1 == n) val += m;
        if(k == 0){
            Q.emplace_back(val);
        }else if(k < i){
            Q.insert(Q.end()-k, val);
            k = 0;
        }else {
            Q.emplace_front(val);
            k -= i;
        }
    }
    for (int i = 0; i < Q.size(); ++i) {
        printf("%lld\n", Q[i]);
    }
    return 0;
}