import std.stdio, std.string, std.conv, std.algorithm, std.numeric;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;

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

    int[] ans;

    if ((k & 1) == 0) {
        ans = [k / 2] ~ repeat(k, n - 1).array;
    } else {
        ans = repeat((k + 1) / 2, n).array;

        foreach (i ; 0 .. n / 2) {
            if (ans.back == 1) {
                ans.popBack();
            }
            else {
                ans.back--;
                ans ~= repeat(k, n - ans.length).array;
            }
        }
    }

    writefln("%(%s %)", ans);
}



void scan(T...)(ref T args) {
    string[] line = readln.split;
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}



void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}