#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;

int main()
{
    int n;
    ll k, m;
    cin>>n>>m>>k;
    vector<ll> v(n);
    ll s=0;
    for(int i=0; i<n; i++){
        v[i]=i;
        s+=i;
    }
    v.back()+=m-s;
    vector<ll> ans;
    for(int i=0; i<n; i++){
        if(k>n-1-i){
            k-=n-1-i;
            ans.push_back(v[n-1-i]);
            continue;
        }
        for(int j=0; j<n-1-i-k; j++){
            ans.push_back(v[j]);
        }
        ans.push_back(v[n-1-i]);
        for(int j=n-1-i-k; j<n-1-i; j++) ans.push_back(v[j]);
        break;
    }
    for(int i=0; i<n; i++) cout<<ans[i]<<endl;
    return 0;
}