#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);++i)
#define rep1(i,n) for(int i=1;i<=int(n);++i)
#define all(a) a.begin(),a.end()
#define lb(s,x) lower_bound(all(s),x)-s.begin()
#define debug(x) cout<<#x<<": "<<x<<endl
#define INF 1e9
typedef long long ll;

void solve(int K,int N){
    if(K%2==0){
        cout<<K/2;
        rep(i,N-1)cout<<" "<<K;
        cout<<endl;
        return;
    }
    vector<int> res;
    rep(i,N)res.push_back((K+1)/2);
    rep(i,N/2){
        if(res.back()==1)res.pop_back();
        else{
            res.back()--;
            while(int(res.size())<N)res.push_back(K);
        }
    }
    rep(i,int(res.size())-1){
        cout<<res[i]<<" ";
    }
    cout<<res.back()<<endl;

}

int main(void){
    int K,N;
    cin>>K>>N;
    solve(K,N);
    return 0;
}
