#include <cmath>
#include <deque>
#include <algorithm>
#include <iterator>
#include <list>
#include <tuple>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <stack>
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
#include <functional>
#include <numeric>
#include <iomanip> 
#include <stdio.h>
#include <assert.h>
#include <cstring>
//eolibraries
#define lnf 3999999999999999999
#define inf 999999999
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
#define all(c) (c).begin(),(c).end()
#define sz(c) (int)(c).size()
#define make_unique(a) sort(all(a)),a.erase(unique(all(a)),a.end())
#define pii pair <int,int>
#define tpii pair<pii,int>
#define rep(i,n) for(int i = 0 ; i < n ; i++) 
#define drep(i,n) for(int i = n-1 ; i >= 0 ; i--)
#define crep(i,x,n) for(int i = x ; i < n ; i++)
#define vi vector <int> 
#define vec(...) vector<__VA_ARGS__>
#define fcin ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
//eodefine
using namespace std;

const int mxn=302;

int main(){
fcin;
	int n;
	ll m,k;
	cin>>n>>m>>k;
	vec(ll) a(n);
	if(k<=n-1){
		rep(i,n){
			if(n-i-1==k){
				a[i]=m-n+1;
				break;
			}
		}
		rep(i,n) if(a[i]==0) a[i]=1;
		rep(i,n) cout<<a[i]<<" ";
		exit(0);
	}
	vec(ll) psum(n);
	crep(i,1,n) a[i]=1;
	k-=(n-1);
	crep(i,1,n-1){
		if(k>=(n-i-1)){
			k-=(n-i-1);
			a[i]++;
			psum[1]++;
			psum[i]--;
		}
	}
	crep(i,1,n) psum[i]+=psum[i-1];
	crep(i,1,n){
		if(a[i]==2) a[i]+=psum[i];
	}
	ll sum=0;
	crep(i,1,n) sum+=a[i];
	a[0]=m-sum;
	rep(i,n) cout<<a[i]<<" ";
// 
	return 0;
}