ド 

Copy
Copy
#include <iostream>
#include<sstream>
#include<string>
#include<vector>
#include <cmath>
#include <limits>
#include <queue>
#include<algorithm>
 
using namespace std;
 
#define rep(i,n) for (int (i)=0;(i)<(n);i++)
#define p pair<int,int>
 
int main(){
    int n, k;
    long long s;
    cin >> n >> k >> s;
    if (s > 2){
        rep(i,k+1){
            if (i%2 == 0) cout << 1 << " ";
            else cout << s-1 << " ";
        }
        rep(i,n-k-1){
            if (k%2 == 0){
                if (i%2 == 0) cout << s-1 << " ";
                if (i%2 == 1) cout << 3 << " ";
            }
            if (k%2 == 1){
                if (i%2 == 0) cout << 3 << " ";
                if (i%2 == 1) cout << s-1 << " ";
            }
        }
    }
    if (s == 1){
        rep(i,k){
            cout << 1 << " ";
        }
        rep(i,n-k) cout << 2 << " ";
    }
        if(s == 2){
        rep(i,k+1){
            cout << 1 << " ";
        }
        rep(i,n-k-1){
            cout << 3 << " ";
        }
    }

 
    return 0;
}