#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k, win;
  cin >> n >> k >> win;
  win--;
  VI a(n);
  rep(i, n) cin >> a[i];
  VI ans{win};
  rep(i, n) a[i]--;
  a[win]--;
  if (a[win] < k) {
    cout << -1 << '\n';
    return 0;
  }
  ll sm = accumulate(all(a), 0LL);
  int mn = *min_element(all(a));
  int round = sm / (n + 1);
  if (mn < 0 || sm % (n+1) || mn < round) {
    cout << -1 << '\n';
    return 0;
  }
  VVI evs(round);
  rep(i, n) if (a[i] > round) {
    int todo = max(a[i] - (k + 1), 0);
    if (todo >= round) {
      cout << -1 << '\n';
      return 0;
    }
    evs[todo].emplace_back(i);
    a[i] -= round;
  }
  priority_queue<int> q;
  rep(r, round) {
    for (int i : evs[r]) {
      q.emplace(i);
    }
    while (q.size() && !a[q.top()]) q.pop();
    if (q.empty()) {
      cout << -1 << '\n';
      return 0;
    }
    ans.emplace_back(q.top());
    a[q.top()]--;
  }
  reverse(all(ans));
  cout << ans.size() << '\n';
  rep(i, round + 1) cout << ans[i] + 1 << " \n"[i + 1 == round + 1];
}