#include <bits/stdc++.h>

using namespace std;
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
#define ten(n) ((int)1e##n)
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;

template<typename ...> static inline int getchar_unlocked(void) { return getchar(); }
template<typename ...> static inline void putchar_unlocked(int c) { putchar(c); }
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
void reader(int& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
void reader(ll& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
int reader(char c[]) { int i, s = 0; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c[s++] = i; for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c[s++] = i; }c[s] = '\0'; return s; }
int reader(string& c) { int i; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c.push_back(i); for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c.push_back(i); }; return sz(c); }
template <class T, class S> void reader(T& x, S& y) { reader(x); reader(y); }
template <class T, class S, class U> void reader(T& x, S& y, U& z) { reader(x); reader(y); reader(z); }
template <class T, class S, class U, class V> void reader(T& x, S& y, U& z, V & w) { reader(x); reader(y); reader(z); reader(w); }
void writer(int x, char c) { int s = 0, m = 0; char f[10]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(ll x, char c) { int s = 0, m = 0; char f[20]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(const char c[]) { int i; for (i = 0; c[i] != '\0'; i++)mypc(c[i]); }
void writer(const string& x, char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
void writer(const char x[], char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
template<class T> void writerLn(T x) { writer(x, '\n'); }
template<class T, class S> void writerLn(T x, S y) { writer(x, ' '); writer(y, '\n'); }
template<class T, class S, class U> void writerLn(T x, S y, U z) { writer(x, ' '); writer(y, ' '); writer(z, '\n'); }
template<class T> void writerArr(T x[], int n) { if (!n) { mypc('\n'); return; }FOR(i, n - 1)writer(x[i], ' '); writer(x[n - 1], '\n'); }
template<class T> void writerArr(vector<T>& x) { writerArr(x.data(), (int)x.size()); }

template<class T> void chmin(T& a, const T& b) { if (a > b) a = b; }
template<class T> void chmax(T& a, const T& b) { if (a < b) a = b; }

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
ll mod_pow(ll a, ll n, ll mod) {
	ll ret = 1;
	ll p = a % mod;
	while (n) {
		if (n & 1) ret = ret * p % mod;
		p = p * p % mod;
		n >>= 1;
	}
	return ret;
}
template<class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b -= q * a, a); } return b; }
template<class T> T mod_inv(T a, T m) { T x, y; extgcd(a, m, x, y); return (m + x % m) % m; }

void ndfs(vector<vector<int>>& ret, vector<int>& cur, int k, int rem) {
	if(sz(cur)) ret.push_back(cur);
	if (rem == 0) return;

	FOR(i, k) {
		cur.push_back(i + 1);
		ndfs(ret, cur, k, rem - 1);
		cur.pop_back();
	}
}

vector<int> naive(int k, int n) {
	vector<vector<int>> ret;
	vector<int> cur;
	ndfs(ret, cur, k, n);
	sort(ret.begin(), ret.end());

	int all = sz(ret);
	//FOR(i, all) {
	//	if (i == all / 2 - 1) printf("* ");
	//	writerArr(ret[i]);
	//}
	int idx = (all + 1) / 2 - 1;

	return ret[idx];
}

vector<int> solve(int k, int n) {
	vector<int> ans;
	if (k == 1) {
		ans.push_back(1);
		FOR(i, (n - 1) / 2) ans.push_back(1);
	} else if (k % 2 == 0) {
		ans.push_back(k / 2);
		FOR(i, n - 1) ans.push_back(k);
	} else {
		FOR(i, n) ans.push_back(k / 2 + 1);
		int diff = n / 2;
		//printf("minus = %d\n", diff);
		FOR(_, diff) {
			if (sz(ans) == n) {
				ans.back()--;
				if (ans.back() == 0) {
					ans.pop_back();
				}
			} else {
				ans.back()--;
				if (ans.back() == 0) {
					ans.pop_back();
				} else {
					while (sz(ans) != n) {
						ans.push_back(k);
					}
				}
			}
		}
	}
	return ans;
}

 int main() {
	 //for(int k = 1; k < 10; k++) for(int n = 1; n < 6; n++) {
		// writerLn(k, n);
		// auto a1 = naive(k, n);
		// auto a2 = solve(k, n);
		// if (a1 != a2) {
		//	 cout << "?" << endl;
		// }
		// writerArr(a1);
		// writerArr(a2);
	 //}

	 int k, n; reader(k, n);

	 auto ans = solve(k, n);
	 writerArr(ans);

	return 0;
}

Measured memory_bytes: 3568