#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii ;
typedef pair<ll, ll> pll ;
typedef vector<pii> vii ;
typedef vector<int> veci ;
typedef vector<pll> vll ;
typedef vector<ll> vecll;
// find_by_order order_of_key
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define F first
#define S second
#define pb push_back
#define endl '\n'
#define Mp make_pair
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " = " << x << endl
#define set_dec(x) cout << fixed << setprecision(x);
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io freopen("in.txt" , "r" , stdin) ; freopen("out.txt" , "w" , stdout);
#define lb lower_bound
#define ub upper_bound
#define for1(n) for(int i=1;i<=n;i++)
#define for0(n) for(int i=0;i<n;i++)
#define forn(n) for(int i=n;i>0;i--)
#define pq priority_queue <pii, vector<pii>, greater<pii>>
const int N=1e5+100,L=18;
int A[N],B[N],C[N],D[N],degg[N],n,m,k,q,deg[N],par[N],mn[N][L],nxt[N],parr[N];
pii c[N];
vector<int>g[N],vec;
int main(){
//fast_io
cin>>n>>k;
for1(n)cin>>A[i];
int lst=0;
for1(n){
mn[i][0]=A[i];
if(A[i]==-1){
par[i]=lst;deg[lst]++;
A[i]=N;lst=i;
}
}
for(int j=1;j<L;j++)for1(n)if(i+(1<<j)<=n+1)mn[i][j]=max(mn[i][j-1],mn[i+(1<<(j-1))][j-1]);
if(lst==0)return cout<<"-1\n",0;
vector<int>vec;
for(int i=n;i>=1;i--){
if(A[i]==N){
vec.pb(i);
continue;
}
if(vec.size()==0)
return cout<<"-1\n",0;
while(A[i]>A[vec.back()]){
vec.pop_back();
if(vec.size()==0)
return cout<<"-1\n",0;
}
par[i]=vec.back();
deg[par[i]]++;
vec.pb(i);
}
A[0]=N;vec.clear();vec.pb(0);
for1(n){
if(A[i]==N){
vec.pb(i);
continue;
}
while(A[i]>A[vec.back()])vec.pop_back();
if(A[i]!=A[vec.back()]){
parr[i]=vec.back();
deg[parr[i]]++;
}
vec.pb(i);
}
for1(n)if(par[i]>i){
int x=par[i]-i-1,mnn=0,ii=i+1;
for(int j=0;j<L;j++)if(x>>j&1){mnn=max(mnn,mn[ii][j]);ii+=(1<<j);}
if(mnn!=A[i]-1)
return cout<<"-1\n",0;
}
deg[0]=degg[0]=-1;
while(k--){
set<int>C;
for1(n){
degg[i]=deg[i];
if(degg[i]==0)
C.insert(i);
}
int lst=-1;
for1(n){
if(C.size()==0)return cout<<"-1\n",0;
if(nxt[i]+1<C.size())lst=i;
auto x=C.begin();
for(int t=0;t<nxt[i];t++)
x++;
int v=(*x);C.erase(x);
B[v]=i;
degg[par[v]]--;
degg[parr[v]]--;
if(degg[par[v]]==0)
C.insert(par[v]);
if(degg[parr[v]]==0)
C.insert(parr[v]);
}
if(lst==-1 && k)return cout<<"-1\n",0;
for(int i=lst+1;i<=n;i++)nxt[i]=0;
nxt[lst]++;
}
for1(n)cout<<B[i]<<" ";cout<<endl;
}
