#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;

int main(){
  int N, M;
  cin >> N >> M;

  vector<int> v;
  rep(i,N){
    v.push_back(1+i);
  }
  sort(ALLOF(v));

  vector<int> ret;
  int score = 0;
  rep(i,M){
    ret.push_back(v[N-1-i]);
    score ^= v[N-1-i];
  }
  rep(i,M){
    v.pop_back();
  }

  {
    for(int b=21; b>=0; b--){
      int x = 1<<(b+1);

      if(((score>>b)&1) == 0){
        int p = -1, q = -1;
        rep(i,ret.size()){
          if(x > ret[i] && ((ret[i]>>b)&1) == 1){
            p = i;
            break;
          }
        }
        if(p >= 0){
          rep(i,v.size()){
            if(x > v[i] && ((v[i]>>b)&1) == 0){
              q = i;
              break;
            }
          }
        }else{
          rep(i,ret.size()){
            if(x > ret[i] && ((ret[i]>>b)&1) == 0){
              p = i;
              break;
            }
          }
          rep(i,v.size()){
            if(x > v[i] && ((v[i]>>b)&1) == 1){
              q = i;
              break;
            }
          }
        }
        if(p>=0 && q>=0){
          score ^= ret[p];
          score ^= v[q];
          swap(ret[p],v[q]);
        }
      }
    }
  }

  cerr << score << endl;

  rep(i,ret.size()){
    if(i>0) cout << " ";
    cout << ret[i];
  }
  cout << endl;
  return 0;
}