#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const long long INF = 1e18;
long long x[N];
bool R[N];
pair<long long, vector<int> > get(vector<int> &v, int r) {
  int n = v.size();
  long long res = INF, id = -1;
  vector<int> ans;
  if (n == 0) return make_pair(0, ans);
  multiset<int> st;
  for (int i = 0; i < n - 2; i++) st.insert(abs(x[v[i]] - x[v[i + 1]]));
  while ((int)st.size() > r) {
    auto it = st.end();
    it--;
    st.erase(it);
  }
  long long sum1 = 0, sum2 = 0;
  for (auto x : st) sum1 += x;
  for (int i = 0; i <= (n - 1); i++) {
    if (2LL * sum1 + sum2 < res) {
      res = 2LL * sum1 + sum2;
      id = i;
    }
    if (i == n - 1) break;
    sum2 += abs(x[v[n - i - 1]] - x[v[n - i - 2]]);
    if (n - i - 3 >= 0 && (int)st.size() > 0) {
      auto it = st.find(abs(x[v[n - i - 3]] - x[v[n - i - 2]]));
      if (it != st.end()) sum1 -= *it, st.erase(it);
      while ((int)st.size() >= r - i) {
        auto it = st.end();
        it--;
        sum1 -= *it;
        st.erase(it);
      }
    }
  }
  set<pair<int, int> > st2;
  for (int i = 0; i < n - id - 2; i++)
    st2.insert(make_pair(abs(x[v[i]] - x[v[i + 1]]), i));
  while ((int)st2.size() > r - id) {
    auto it = st2.end();
    it--;
    st2.erase(it);
  }
  for (auto x : st2) {
    int p = x.second;
    R[p] = 1;
  }
  for (int i = n - 2; i >= n - id - 1; i--) R[i] = 1;
  int i = 0;
  while (i < n) {
    int j = i;
    while (j < n && R[j] == 1) j++;
    for (int k = j; k >= i; k--) ans.push_back(v[k]);
    i = j + 1;
  }
  return make_pair(res, ans);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, l, s;
  cin >> n >> l >> s;
  for (int i = 1; i <= n; i++) cin >> x[i];
  if (l == 0 && s != 1) {
    cout << -1 << endl;
    return 0;
  }
  if (l == n - 1 && s != n) {
    cout << -1 << endl;
    return 0;
  }
  if (l > s - 1) {
    long long ans1 = 2LL * x[n] - x[s] - x[1];
    vector<int> v;
    for (int i = s + 1; i <= n; i++) v.push_back(i);
    auto X = get(v, l - (s - 1));
    X.first += x[s] + x[n] - 2LL * x[0];
    int r = n - 1 - l;
    if (X.first >= ans1) {
      cout << ans1 << endl;
      for (int i = s + 1; i < s + r; i++) cout << i << ' ';
      if (s != n) cout << n << ' ';
      for (int i = n - 1; i >= s + r; i--) cout << i << ' ';
      for (int i = s - 1; i >= 1; i--) cout << i << ' ';
      cout << endl;
      return 0;
    } else {
      cout << X.first << endl;
      for (int i = s - 1; i >= 1; i--) cout << i << ' ';
      for (auto i : X.second) cout << i << ' ';
      cout << endl;
      return 0;
    }
  } else {
    long long ans1 = x[n] + x[s] - 2LL * x[0];
    vector<int> v;
    for (int i = s - 1; i >= 1; i--) v.push_back(i);
    auto X = get(v, s - l - 1);
    X.first += 2LL * x[n] - x[s] - x[0];
    if (X.first >= ans1) {
      cout << ans1 << endl;
      for (int i = s - 1; i > s - l; i--) cout << i << ' ';
      if (s != 1) cout << 1 << ' ';
      for (int i = 2; i <= s - l; i++) cout << i << ' ';
      for (int i = s + 1; i <= n; i++) cout << i << ' ';
      cout << endl;
      return 0;
    } else {
      cout << X.first << endl;
      for (int i = s + 1; i <= n; i++) cout << i << ' ';
      for (auto i : X.second) cout << i << ' ';
      cout << endl;
      return 0;
    }
  }
}
