import std.algorithm, std.container, std.conv, std.math, std.range, std.typecons, std.stdio, std.string;

auto rdsp(){return readln.splitter;}
void pick(R,T)(ref R r,ref T t){t=r.front.to!T;r.popFront;}
void readV(T...)(ref T t){auto r=rdsp;foreach(ref v;t)pick(r,v);}

void main()
{
  int k, n; readV(k, n);

  auto ans = new int[](n), s = n;

  if (k%2 == 0) {
    ans[0] = k/2;
    ans[1..$][] = k;
  } else {
    ans[] = (k+1)/2;
    foreach (i; 0..n/2) {
      if (ans[s-1] == 1) {
        --s;
      } else {
        ans[s-1]--;
        ans[s..n][] = k;
        s = n;
      }
    }
  }

  foreach (i; 0..s) {
    write(ans[i]);
    if (i < s-1) write(" ");
  }
  writeln;
}
