#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;
 
ll K, N;
 
int main(void) {
  cin >> K >> N;
 
  vector<ll> ans(N);
  if(K % 2 == 0) {
    ans[0] = K / 2;
    REP(i, 1, N) ans[i] = K;
  } else {
    REP(i, 0, N) ans[i] = (K + 1) / 2;
    int p = 0;
    REP(i, 0, N / 2) {
      if(ans[N - 1 - p] == 0) p++;
      ans[N - 1 - p]--;
      if(p > 0 && ans[N - 1 - p] > 0) for(; p > 0; p--) ans[N - p] = K;
    }
    ans.erase(find(ans.begin(), ans.end(), 0), ans.end());
  }
  REP(i, 0, ans.size()) cout << ans[i] << (i + 1 != ans.size() ? " " : "\n");
}