#include <bits/stdc++.h>
using namespace std;
int main(){
    int N;
    long long M, K;
    cin >> N >> M >> K;
    vector<long long> A(N);
    for(int i = 0; i < N; i++){
        if(i != N - 1) A[i] = i;
        else A[i] = M - (long long)(N - 2) * (long long)(N - 1) / 2;
    }
    vector<long long> temp(N);
    int now = 0;
    vector<long long> B(N, -1);
    long long ind = N - 1;
    while(K > 0){
        if(K >= ind){
            K -= ind;
            B[ind] = A[now];
            now++;
            ind--;
        }
        else{
            B[K] = A[now];
            K = 0;
            now++;
        }
    }
    for(int i = 0; i < N; i++){
        if(B[i] == -1){
            B[i] = A[now];
            now++;
        }
    }
    for(int i = 0; i < N; i++) printf("%lld\n", B[i]);
}