#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using pq_ = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(int)(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

#include <atcoder/lazysegtree>

#include <atcoder/segtree>

using lazy_S = int;
using lazy_F = int;

lazy_S lazy_op(lazy_S l, lazy_S r) {
    return max(l, r);
}

lazy_S lazy_e() { return -INF; }

lazy_S mapping(lazy_F l, lazy_S r) {
    return l + r;
}

//l(r(x))
lazy_F composition(lazy_F l, lazy_F r) {
    return l + r;
}

lazy_F lazy_id(){return 0;}

bool f(int x) {
    return x < 0;
}

#define lazy_calc lazy_S,lazy_op,lazy_e,lazy_F,mapping,composition,lazy_id

int op(int a, int b) {
    return min(a, b);
}
int e() {
    return INF;
}

void solve();
// DEAR MYSTERIES / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    ll N, K, M;
    cin >> N >> K >> M;
    M--;
    vector<ll> A(N);
    rep(i, 0, N) cin >> A[i];
    ll T = vec_sum(A);
    if (T % (N + 1)) {
        cout << "-1\n";
        return;
    }
    T /= (N + 1);
    rep(i, 0, N) {
        A[i] -= T;
        if (A[i] < 0) {
            cout << "-1\n";
            return;
        }
    }
    assert(vec_sum(A) == T);
    if (T - 1 + min(T - 1, A[M] - 1) < K || A[M] == 0) {
        cout << "-1\n";
        return;
    }
    A[M]--;
    vector<ll> lim(N);
    vector<vector<int>> G(T);
    rep(i, 0, N) {
        if (A[i] == 0) continue;
        // A[i] - 1 + lim[i] < K
        // A[i] + lim[i] <= K
        // lim[i] <= K - A[i]
        if (K < A[i]) {
            cout << "-1\n";
            return;
        }
        lim[i] = K - A[i];
        chmin(lim[i], T - 2);
        G[lim[i]].push_back(i);
    }
    vector<int> S(T);
    rep(i, 0, N) if (A[i]) {
        S[lim[i]] += A[i];
    }
    rep(i, 0, T - 1) {
        S[i + 1] += S[i];
    }
    rep(i, 0, T) {
        S[i] -= i + 1;
        if (S[i] > 0) {
            cout << "-1\n";
            return;
        }
    }
    atcoder::lazy_segtree<lazy_calc> seg(S);
    atcoder::segtree<int, op, e> mim(T);
    rep(i, 0, T) if (G[i].size()) {
        reverse(all(G[i]));
        mim.set(i, G[i].back());
    }
    vector<int> ans(T);
    ans[T - 1] = M;
    rep(i, 0, T - 1) {
        int r = seg.max_right<f>(i);
        auto tmp = mim.prod(i, r + 1);
        ans[i] = tmp;
        A[tmp]--;
        if (A[tmp] == 0) {
            G[lim[tmp]].pop_back();
            if (G[lim[tmp]].empty()) mim.set(lim[tmp], e());
            else mim.set(lim[tmp], G[lim[tmp]].back());
        }
        seg.apply(i, lim[tmp], -1);
    }
    for (auto &x : ans) x++;
    vec_out(ans, 1);
}

/*
 * 入力から試合数と勝ち数がわかる
 * k 試合目で勝負が決まる時、
 * それまでに K - k + 1 回以上勝っている必要がある
 * bT = M
 * それぞれのチームについて、
 * ここまでには全て出ている必要がある
 * という条件がある
 * それを満たすように貪欲だと、後ろから決めたすぎ！
 *
 */