#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define all(x) (x).begin(), (x).end()
#define dump(x)  cerr << #x << " = " << (x) << endl;
template<typename T> using V = vector<T>;
template<typename T> using P = pair<T, T>;
using Vi = V<int>;
using Vl = V<ll>;
using Vd = V<ld>;
using Vb = V<bool>;
using VVi = V<Vi>;
using VVl = V<Vl>;
using VVb = V<Vb>;
using Pi = P<int>;
using Pl = P<ll>;
using Pd = P<ld>;
template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<typename T> inline int sz(T &x) { return x.size(); }
template<typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
template<typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { os << '(' << p.first << ", " << p.second << ')'; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v) { for (auto &e : v) is >> e; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<typename T> inline int count_between(vector<T> &a, T l, T r) { return lower_bound(all(a), r) - lower_bound(all(a), l); } // [l, r)
inline int cDiv(const ll x, const ll y) { return (x+y-1) / y; } // ceil(x/y)
inline int fLog2(const ll x) { assert(x > 0); return 63-__builtin_clzll(x); } // floor(log2(x))
inline int cLog2(const ll x) { assert(x > 0); return (x == 1) ? 0 : 64-__builtin_clzll(x-1); } // ceil(log2(x))
inline int popcount(const ll x) { return __builtin_popcountll(x); }
inline void fail() { cout << -1 << '\n'; exit(0); }
// struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
// const int INF  = 1<<30;
// const ll INFll = 1ll<<60;
// const ld EPS   = 1e-10;
// const ld PI    = acos(-1.0);
// const int MOD  = int(1e9)+7;
// const int MOD  = 998244353;


void solve2(ll k, ll n, ll l) {
  if (n == 0) return;
  ll a = 0;
  rep(i, n-1) a = k * (a+1);
  
  ll d = l / (a + 1);
  ll r = l % (a + 1);
  cout << (d+1) << ' ';
  if (r == 0) return;
  solve2(k, n-1, r-1);
}


void solve(ll k, ll n) {
  if (k % 2 == 0) {
    cout << (k/2) << ' ';
    rep(i, n-1) cout << k << ' ';
    return;
  }

  ll m = 0;
  Vl a(n+2);
  for (; a[m] <= n-m; ++m) a[m+1] = k * (a[m]+1);

  rep(i, n-m) cout << (k+1)/2 << ' ';
  
  ll l = (a[m]-1-n+m) / 2;
  solve2(k, m, l);
}


int main() {
  ll k, n; cin >> k >> n;
  solve(k, n);
  cout << '\n';

  // ll k, n, l; cin >> k >> n >> l;
  // solve2(k, n, l);
  // rep(i, l) {
  //   solve2(k, n, i);
  //   cout << '\n';
  // }
}


Measured memory_bytes: 5572