Problem: The story was not finished as PMP thought. God offered him one more chance to reincarnate and come back to life. But before he can come back, God told him that PMP should ask n great men including prominent programmers about their life experiences.

The men are standing on a straight line. They are numbered 1 through n from left to right. The coordinate of the i-th man is xi (xi < xi + 1, i < n). PMP should visit all these people one by one in arbitrary order. Each men should be visited exactly once. At the beginning of his tour, he starts at location of s-th man and asks him about his experiences.

Each time PMP wants to change his location, he should give a ticket to an angel and the angel carries him to his destination. Angels take PMP from one location, fly to his destination and put him down there. Nobody else is visited in this movement. Moving from i-th man to j-th man, takes |xi - xj| time. PMP can get back to life as soon as he visits all men.

There are two types of angels: Some angels are going to the right and they only accept right tickets. Others are going the left and they only accept left tickets. There are an unlimited number of angels of each type. PMP has l left tickets and n - 1 - l right tickets.

PMP wants to get back to life as soon as possible to be able to compete in this year's final instead of the final he missed last year. He wants to know the quickest way to visit all the men exactly once. He also needs to know the exact sequence moves he should make.

Input

The first line of input contains three space-separated integers n, l, s (2 ≤ n ≤ 105, 0 ≤ l < n, 1 ≤ s ≤ n) — the number of people to visit, the number left tickets PMP got, and initial location of PMP. Next line contains n space-separated integers. The i-th integer in this line is xi (0 = x1 < x2 < ... < xn ≤ 109) — the location of i-th man.

Output

If PMP cannot visit all men with the tickets he got print -1 in the only line of output. Otherwise, in the first line you should print the minimum time PMP can visit all men. In the second line you should print n - 1 integers that are the numbers of the men that PMP should visit in order in one optimal solution. If there are multiple answers, output any of them.

Please do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64d specifier.

Examples

Input

5 2 2
0 10 11 21 22


Output

33
1 3 5 4


Input

4 3 1
0 1 2 3


Output

-1


Input

7 3 2
0 100 200 201 301 303 305


Output

409
1 3 4 7 6 5

Note

Let us remind here, a great contestant of all times, who left us about a year ago. May Renat Mullakhanov rest in peace.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
const int MAXN = 100005;
int a[MAXN], b[MAXN], ans1[MAXN], ans2[MAXN], mark[MAXN];
int i, j, k, N, L, S, id, cnt, cc;
long long sum1, sum2;
pair<int, int> Left[MAXN];
void init() {
  scanf("%d%d%d", &N, &L, &S);
  for (i = 1; i <= N; i++) scanf("%d", &a[i]);
}
inline long long Solve(int x[], int S, int L, int ans[]) {
  if (S >= N) return INF;
  if (S > L) {
    for (mark[S] = ++id, i = 1; i < L; i++) ans[i] = S - i, mark[S - i] = id;
    ans[L] = 1, mark[1] = id;
    for (i = 2, k = L; i <= N; i++)
      if (mark[i] < id) mark[i] = id, ans[++L] = i;
    return x[N] + x[S];
  }
  for (i = 1, mark[S] = ++id; i < S; i++) ans[i] = S - i, mark[S - i] = id;
  int mip = S + 1;
  long long best = 2 * x[N] - x[S] - x[S + 1], cur, triple = 0;
  L -= (S - 1);
  priority_queue<int> h;
  if (S + L + 1 < N)
    for (i = S + 2; i <= N; i++) {
      if (N - i >= L) {
        if ((cur = 2 * x[N] - x[S] - x[i]) < best) best = cur, mip = i;
      } else {
        triple -= h.top(), h.pop();
        cur = triple * 2 + 2 * x[N] - x[S] - x[i];
        if (cur < best) best = cur, mip = i;
      }
      h.push(x[i - 1] - x[i]);
    }
  for (i = S + 2, cnt = S - 1, cc = 0; i < mip; i++)
    Left[++cc] = make_pair(x[i] - x[i - 1], i - 1);
  sort(Left + 1, Left + cc + 1);
  for (i = 1, ++id; i <= L - N + mip; i++) mark[Left[i].second] = id;
  if (L - N + mip > 0) {
    for (i = S + 1; i < mip; i = j + 1) {
      for (j = i; mark[j] >= id; j++)
        ;
      for (k = j; k >= i; ans[++cnt] = k--)
        ;
    }
    for (i = N - 1, ans[++cnt] = N; i >= mip; i--) ans[++cnt] = i;
  } else {
    for (i = S + 1; i < mip; i++) ans[++cnt] = i;
    int ll = N - mip - L;
    for (i = 1, ++id; i <= ll; i++) ans[++cnt] = i, mark[i] = id;
    for (i = N; i >= mip; i--)
      if (mark[i] < id) ans[++cnt] = i;
  }
  return best + 2 * x[S];
}
bool NoSol(int N, int S, int L) {
  if (!L && S > 1) return 1;
  if (L + 1 >= N && S < N) return 1;
  return 0;
}
void work() {
  if (NoSol(N, S, L)) {
    puts("-1");
    return;
  }
  sum1 = Solve(a, S, L, ans1);
  for (i = 1; i <= N; i++) b[i] = a[N] - a[N - i + 1];
  sum2 = Solve(b, N - S + 1, N - L - 1, ans2);
  if (sum1 < sum2) {
    printf("%I64d\n", sum1);
    for (i = 1; i < N; i++) printf("%d%c", ans1[i], (i + 1 < N ? ' ' : '\n'));
  } else {
    printf("%I64d\n", sum2);
    for (i = 1; i < N; i++)
      printf("%d%c", N - ans2[i] + 1, (i + 1 < N ? ' ' : '\n'));
  }
}
int main() {
  init();
  work();
  return 0;
}