#include<bits/stdc++.h>
#include <unordered_map>
using namespace std;




const int N = 1e5+5;
const int M = 32;
typedef long long ll;
typedef double db;
typedef pair<int, int>pii;
typedef pair<long, long>pll;
int dx[4] = { 0, 1, 0, -1 }, dy[4] = { 1, 0, -1, 0 };
const int mod = 1e5 + 3ll;
inline long long read()
{
	long long w = 1;
	long long q = 0;
	char ch = ' ';
	while (ch != '-' && (ch < '0' || ch>'9')) ch = getchar();
	if (ch == '-') w = -1, ch = getchar();
	while (ch >= '0' && ch <= '9')
		q = q * 10 + ch - '0', ch = getchar();
	return w * q;
}
ll ebs(ll x, ll y)
{
	if (y == 0)
		return 1;
	else {
		ll dp = ebs(x, y / 2);
		if (y % 2 == 0)
		{
			return ((dp % mod) * (dp % mod)) % mod;
		}
		else {
			return ((dp % mod) * (dp % mod) * (x % mod)) % mod;
		}
	}
}

//"----------------------     code     --------------------------"



void solve() {
	int n, k;
	cin >> n >> k;
	if (k == 0)
	{
		cout << -1 << endl;
		return;
	}
	for (int i = 2; i <= k; i++)
	{
		cout <<i << " ";
	}
	cout << 1 << " ";
	for (int i = k + 1; i <= n; i++)
	{
		cout << i << " ";
	}
	cout << endl;
}
int main()
{
	int tcase = 1;
	//cin>>tcase;
	while (tcase--)
	{
		solve();
	}
	return 0;
}