// Code by Heratino & Nelofus
// Narcissus & どうか安寧な記憶を

#include <bits/stdc++.h>
using i64 = long long;

//{{{星光闪耀
template<typename Ta, typename Tb>
inline void chkmax(Ta &a, const Tb &b) {if (a < b)	a = b;}
template<typename Ta, typename Tb>
inline void chkmin(Ta &a, const Tb &b) {if (a > b)	a = b;}
char buf[1 << 20], *P1, *P2;
inline char gc() {
	if (P1 == P2)
		P2 = (P1 = buf) + fread(buf, 1, 1 << 20, stdin);
	return P1 == P2 ? EOF : *P1++;
}
template<typename T>
inline void read(T &ans) {
	ans = 0;
	T w = 1;
	char c = gc();
	while (!isdigit(c)) {
		if (c == '-')	w = -1;
		c = gc();
	}
	while (isdigit(c)) {
		ans = (ans << 3) + (ans << 1) + (c ^ 48);
		c = gc();
	}
	ans *= w;
}
template<typename T, typename ...Ts>
void read(T &a, Ts&... other) {
	read(a);
	read(other...);
}
//}}}

void solve() {
	int n, k;
	read(n, k);
	if (k == 0) {
		std::cout << "-1" << '\n';
		return ;
	} else if (k == 1) {
		for (int i = 1; i <= n; i++)
			std::cout << i << " \n"[i == n];
	} else {
		k--;
		std::vector<int> ans;
		ans.push_back(n - k + 1);
		for (int i = 2; i < n - k + 1; i++)
			ans.push_back(i);
		for (int i = n - k + 1; i < n; i++)
			ans.push_back(i + 1);
		ans.push_back(1);
		for (int i = 0; i < n; i++)
			std::cout << ans[i] << " \n"[i == n - 1];
	}
}

int main() {
	int T = 1;
	while (T--) {
		solve();
	}
	return 0;
}