#include <bits/stdc++.h>

using namespace std;

#define rep(i, n) for (int i = 0; i < (int) (n); i++)

int n, k;

void solve0()
{
	if (n == 1) {
		cout << k / 2;
		cout << endl;
		return;
	}
	cout << k / 2 << " ";
	rep(i, n-2) {
		cout << k << " ";
	}
	cout << k << endl;
}

void sub(vector<int>& v, int& pos)
{
	if (v[pos] == 1) {
		v[pos] = 0;
		pos--;
	} else {
		v[pos]--;
		for (int i = pos+1; i < n; i++) v[i] = k;
		pos = n-1;
	}
}

void solve1()
{
	vector<int> res(n, k / 2 + 1);
	long long a = n / 2;
	int pos = n-1;
	while (a--) {
		sub(res, pos);
	}
	for (int i = 0; i < pos; i++) {
		cout << res[i] << " ";
	}
	cout << res[pos] << endl;
}

int main()
{
	cin >> k >> n;
	if (k % 2) solve1();
	else solve0();
}
