#include "bits/stdc++.h"
#define REP(i,n,N) for(ll i=(n); i<(N); i++)
#define RREP(i,n,N) for(int i=(N-1); i>=n; i--)
#define CK(n,a,b) (a)<=(n)&&(n)<(b)
#define ALL(v) (v).begin(),(v).end()
#define p(s) cout<<(s)<<endl
typedef long long ll;
using namespace std;
const ll inf=1e18;

int n, k;
int main(){
    int kado[4] = {1,3,2,4};
    while(cin>>n>>k){
        cout<<1<<" "<<3;
        REP(i,0,n-k-2){
            cout<<" "<<kado[(i+2)%4];
        }
        REP(i,0,k){
            cout<<" "<<kado[(n-k+3)%4];
        }
        cout<<endl;
    }
    return 0;
}