#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;

  if(K % 2 == 0) {
    cout << K / 2;
    REP(i, 1, N) cout << " " << K;
    cout << endl;
  } else {
    vector<ll> ans(N, (K + 1) / 2);
    ll j = 0;
    REP(i, 0, N / 2) {
      if(ans[N - 1 - j] == 0) j++;
      ans[N - 1 - j]--;
      if(j > 0 && ans[N - 1 - j] > 0) for(; j > 0; j--) ans[N - j] = K;
    }
    cout << ans[0];
    REP(i, 1, N) {
      if(ans[i] == 0) break;
      cout << " " << ans[i];
    }
    cout << endl;
  }
}
