#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define pii pair<ll, ll>
#define fi first
#define sec second
#define ld long double
const int MAXN = 5e5;
const ll INF = 1e18;
const int MOD = 1e9 + 7;
const ld eps = 1e-6;
ll a[MAXN + 5];
int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);		
	int tc = 1;	
	// cin >> tc;
	for(;tc--;){
		ll N, K; cin >> N >> K;
		for(int i = 1; i <= N; i++) cin >> a[i];
		sort(a + 1, a + 1 + N);
		vector<ll> v;
		for(int i = N - K + 1; i <= N; i++) v.push_back(a[i]);
		for(int i = 1; i <= N - K; i++) v.push_back(a[i]);
		
		ll bad = 0;
		for(auto x : v){
			if(x <= bad) continue;
			bad++;
		}
		
		if(bad == K){
			reverse(v.begin(), v.end());
			for(auto x : v) cout << x << " ";
			cout << "\n";
		}
		else cout << "-1\n";
	}
}
/*
*/
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |