#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <queue>
using ll = long long;
using namespace std;

int main(void)
{
    int N, K;
    cin >> N >> K;
    if (K == N - 2)
    {
        for (int i = 1; i <= N; ++i)
        {
            if (i != 1)
                cout << " ";
            cout << i;
        }
        cout << endl;
    }
    else
    {
        int t = N - K - 2;
        vector<int> v;
        v.push_back(1);
        v.push_back(3);
        for (int i = 0; i < N - 2; ++i)
        {
            if (t == 0)
                break;
            if (i % 4 == 0)
                v.push_back(2);
            else if (i % 4 == 1)
                v.push_back(4);
            else if (i % 4 == 2)
                v.push_back(1);
            else
                v.push_back(3);
            t--;
        }
        int n = v.size();
        while (v.size() != N)
        {
            v.push_back(v[n - 1]);
        }
        for (int i = 0; i < N; ++i)
        {
            if (i)
                cout << " ";
            cout << v[i];
        }
    }
    return 0;
}