#include <bits/stdc++.h>
using namespace std;

int ct, k, n, ans[300005];
int main()
{
	scanf("%d%d", &k, &n);
	if (!(k & 1))
	{
		ans[1] = k / 2;
		for (int i = 2; i <= n; i++)
			ans[i] = k;
		for (int i = 1; i <= n; i++)
			printf("%d ", ans[i]);
	}
	else
	{
		int pnt = n;
		for (int i = 1; i <= n; i++)
			ans[i] = (k + 1) / 2;
		for (int i = 1; i <= n / 2; i++)
			while (true)
			{
				ans[pnt]--;
				if (ans[pnt] == -1)
					ans[pnt] = 0, pnt--;
				else
				{
					if (!ans[pnt]) pnt--;
					else while (pnt != n)
						ans[++pnt] = k;
					break;
				}
			}
		for (int i = 1; i <= n; i++)
			if (ans[i]) printf("%d ", ans[i]);
	}
	return 0;
}