#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

int A[20200];

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    int N, K;
    std::cin >> N >> K;

    if(N - K - 2 == 0){

    }else{
        A[0] = 0 + (1000000000 / 2);
        A[1] = 1 + (1000000000 / 2);;
        A[2] = -1 + (1000000000 / 2);;

        int rest = (N - K - 2) - 1;
        int cur = 2, idx = 3;
        while(rest > 0){
            A[idx] = cur + (1000000000 / 2);;
            ++idx;
            --rest;

            if(rest == 0){break;}

            A[idx] = -cur + (1000000000 / 2);;
            ++idx;
            --rest;
        
            ++cur;
        }

        for(int i=idx;i<N;++i){
            A[i] = A[idx-1];
        }
    }

    for(int i=0;i<N;++i){
        std::cout << A[i] << " \n"[i+1 == N];
    }
}