#include<bits/stdc++.h>
#define f1(i, n) for(ll i=1;i<=n;++i)
#define f0(i, n) for(ll i=0;i<n;++i)
#define ull unsigned long long
#define ll long long
#define rev(a) reverse(a.begin(),a.end())
#define all(x) x.begin(),x.end()
#define so(A, n) sort(A+1, A+n+1)
using namespace std;
const int maxn = 200010;
const int N = 1e6 + 1;
void solve4() {
int n, k;
cin >> n >> k;
if (n % 2 != 0) {cout << -1; return;}
if (k == n / 2 && n % 2 == 0) {
for (int i = n / 2 + 1; i <= n; ++i) cout << i << " ";
for (int i = 1; i <= n / 2; ++i) cout << i << " ";
}
else if (k == 1) {
for (int i = 1; i <= n; i += 2) {
cout << i + 1 << " " << i << " ";
}
}
else if (k == 0) {
f1(i, n) cout << i << " ";
}
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
solve4();
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KI2RlZmluZSBmMShpLCBuKSBmb3IobGwgaT0xO2k8PW47KytpKQojZGVmaW5lIGYwKGksIG4pIGZvcihsbCBpPTA7aTxuOysraSkKI2RlZmluZSB1bGwgdW5zaWduZWQgbG9uZyBsb25nCiNkZWZpbmUgbGwgbG9uZyBsb25nCiNkZWZpbmUgcmV2KGEpIHJldmVyc2UoYS5iZWdpbigpLGEuZW5kKCkpCiNkZWZpbmUgYWxsKHgpIHguYmVnaW4oKSx4LmVuZCgpCiNkZWZpbmUgc28oQSwgbikgc29ydChBKzEsIEErbisxKQp1c2luZyBuYW1lc3BhY2Ugc3RkOwpjb25zdCBpbnQgbWF4biA9IDIwMDAxMDsKY29uc3QgaW50IE4gPSAxZTYgKyAxOwp2b2lkIHNvbHZlNCgpIHsKCWludCBuLCBrOwoJY2luID4+IG4gPj4gazsKCWlmIChuICUgMiAhPSAwKSB7Y291dCA8PCAtMTsgcmV0dXJuO30KCWlmIChrID09IG4gLyAyICYmIG4gJSAyID09IDApIHsKCQlmb3IgKGludCBpID0gbiAvIDIgKyAxOyBpIDw9IG47ICsraSkgY291dCA8PCBpIDw8ICIgIjsKCQlmb3IgKGludCBpID0gMTsgaSA8PSBuIC8gMjsgKytpKSBjb3V0IDw8IGkgPDwgIiAiOwoJfQoJZWxzZSBpZiAoayA9PSAxKSB7CgkJZm9yIChpbnQgaSA9IDE7IGkgPD0gbjsgaSArPSAyKSB7CgkJCWNvdXQgPDwgaSArIDEgPDwgIiAiIDw8IGkgPDwgIiAiOwoJCX0KCX0KCWVsc2UgaWYgKGsgPT0gMCkgewoJCWYxKGksIG4pIGNvdXQgPDwgaSA8PCAiICI7Cgl9Cn0KaW50IG1haW4oKQp7Cglpb3NfYmFzZTo6c3luY193aXRoX3N0ZGlvKDApOyBjaW4udGllKDApOyBjb3V0LnRpZSgwKTsKCXNvbHZlNCgpOwoKCXJldHVybiAwOwp9Cgo=