#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#include <functional>
#include <ctime>
#include <bitset>
#pragma warning(disable:4996) 

//#define ATCODER
#ifdef ATCODER
#include <atcoder/all>
#endif

typedef long long ll;
typedef unsigned long long ull;
#define LINF  9223300000000000000
#define LINF2 1223300000000000000
#define LINF3 1000000000000
#define INF 2140000000
//const long long MOD = 1000000007;
const long long MOD = 998244353;

using namespace std;
#ifdef ATCODER
using namespace atcoder;
#endif


void solve()
{
    int n; ll M, K;
    scanf("%d%lld%lld", &n, &M, &K);
    vector<ll> a(n);
    ll s = 0;
    for (int i = 0; i < n; i++) {
        a[i] = i;
        s += i;
    }
    assert(M >= s);
    a[n - 1] += (M - s);

    vector<ll> ans;
    for (int i = 0; i < n; i++) {
        int tmp = n - 1 - i;
        if (K >= tmp) {
            ans.push_back(a[n - 1 - i]);
            K -= tmp;
        }
        else {
            ans.push_back(a[K]);
            for (int k = 0; k <= tmp; k++) {
                if (k != K) ans.push_back(a[k]);
            }
            K = 0;
            break;
        }
    }
    assert(K == 0);
    for (int i = 0; i < n; i++) {
        printf("%lld\n", ans[i]);
    }
    return;
}

int main()
{
#if 1
    solve();
#else
    int T, t;
    scanf("%d", &T);
    for (t = 0; t < T; t++) {
        //printf("Case #%d: ", t + 1);
        solve();
    }
#endif
    return 0;
}