#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

int main() {
    int N,K;
    cin >> N >> K;
    K = N-2-K;
    
    int X[4] = { 2,-2,1,-1 };
    vector<int> A(N,10);
    if ( K ) { A[0] -= 2; A[2]--; }
    if ( K >= 2 ) { A[1]++; }

    for ( int i = 0; i < K-2; i++ ) {
        A[3+i] += X[i%4];
    }

    for ( int i = 0; i < N; i++ ) {
        cout << A[i];
        if ( i != N-1 ) { cout << " "; }
    }
    cout << endl;
    return 0;
}