#include<iostream>
#include<iomanip>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<vector>
#include<cctype>
#define szxb 300010
#define F(a) for(register int (i)(1);(i)^((a)+(1));(i)++)
using namespace std;
int n,m,a[szxb];
signed main(){scanf("%d%d",&n,&m);if(n&1){F(m){a[i]=(n+1)>>1;}int cnt(m>>1),now(m);while(cnt--){((!(a[now]-1))?(a[now--]=n):(--a[now],now=m));}F(now){printf("%d ",a[i]);}}else{printf("%d ",n>>1);F(m-1){printf("%d ",n);}}return putchar(10),0;}