#include <bits/stdc++.h>
using namespace std;
int N, S;
int A[200020], B[200020];
vector<int> vx;
int pp[200020];
int Find(int x) { return pp[x] == x ? x : pp[x] = Find(pp[x]); }
vector<int> vs[2][200020];
int nxt[200020];
int main() {
  scanf("%d%d", &N, &S);
  for (int i = 1; i <= N; i++) scanf("%d", A + i);
  for (int i = 1; i <= N; i++) vx.push_back(A[i]);
  sort(vx.begin(), vx.end());
  vx.resize(unique(vx.begin(), vx.end()) - vx.begin());
  for (int i = 1; i <= N; i++)
    A[i] = (int)(lower_bound(vx.begin(), vx.end(), A[i]) - vx.begin() + 1);
  for (int i = 1; i <= N; i++) B[i] = A[i];
  sort(B + 1, B + 1 + N);
  int cnt = 0;
  for (int i = 1; i <= N; i++)
    if (B[i] != A[i]) ++cnt;
  if (cnt > S) {
    puts("-1");
    return 0;
  }
  for (int i = 1; i <= N; i++) pp[i] = i;
  for (int i = 1; i <= N; i++)
    if (A[i] != B[i]) {
      vs[0][A[i]].push_back(i);
      vs[1][B[i]].push_back(i);
    }
  int L = (int)vx.size();
  for (int i = 1; i <= L; i++) {
    int n = (int)vs[0][i].size();
    for (int j = 0; j < n; j++) {
      int x = vs[0][i][j], y = vs[1][i][j];
      nxt[x] = y;
      int px = Find(x), py = Find(y);
      if (px != py) pp[px] = py;
    }
  }
  for (int i = 1; i <= L; i++) {
    int n = (int)vs[0][i].size();
    for (int j = 1; j < n; j++) {
      int x = vs[0][i][0];
      int y = vs[0][i][j];
      int px = Find(x), py = Find(y);
      if (px != py) {
        swap(nxt[x], nxt[y]);
        pp[px] = py;
      }
    }
  }
  int c[200020] = {};
  for (int i = 1; i <= N; i++) c[Find(i)]++;
  vector<pair<int, int> > v;
  for (int i = 1; i <= N; i++)
    if (pp[i] == i && A[i] != B[i]) v.push_back(pair<int, int>(c[i], i));
  sort(v.begin(), v.end());
  reverse(v.begin(), v.end());
  S -= cnt;
  vector<vector<int> > ans;
  if (S > 2 && (int)v.size() > 2) {
    int r = min(S, (int)v.size());
    int save = nxt[v[0].second];
    for (int i = 0; i < r - 1; i++) nxt[v[i].second] = nxt[v[i + 1].second];
    nxt[v[r - 1].second] = save;
    vector<int> nv;
    for (int i = 0; i < r; i++) nv.push_back(v[i].second);
    reverse(nv.begin(), nv.end());
    ans.push_back(nv);
    for (int i = 1; i < r; i++) pp[Find(v[i].second)] = Find(v[0].second);
  }
  for (int i = 1; i <= N; i++)
    if (A[i] != B[i] && pp[i] == i) {
      vector<int> v;
      v.push_back(i);
      for (int t = nxt[i]; t != i; t = nxt[t]) {
        v.push_back(t);
      }
      ans.push_back(v);
    }
  printf("%d\n", (int)ans.size());
  for (auto e : ans) {
    printf("%d\n", (int)e.size());
    for (int f : e) printf("%d ", f);
    puts("");
  }
  return 0;
}

### Prompt

Create a solution in CPP for the following problem:

You are given an array of n positive integers a_1, a_2, ..., a_n. You can perform the following operation any number of times: select several distinct indices i_1, i_2, ..., i_k (1 ≤ i_j ≤ n) and move the number standing at the position i_1 to the position i_2, the number at the position i_2 to the position i_3, ..., the number at the position i_k to the position i_1. In other words, the operation cyclically shifts elements: i_1 → i_2 → … i_k → i_1.

For example, if you have n=4, an array a_1=10, a_2=20, a_3=30, a_4=40, and you choose three indices i_1=2, i_2=1, i_3=4, then the resulting array would become a_1=20, a_2=40, a_3=30, a_4=10.

Your goal is to make the array sorted in non-decreasing order with the minimum number of operations. The additional constraint is that the sum of cycle lengths over all operations should be less than or equal to a number s. If it's impossible to sort the array while satisfying that constraint, your solution should report that as well.

Input

The first line of the input contains two integers n and s (1 ≤ n ≤ 200 000, 0 ≤ s ≤ 200 000)—the number of elements in the array and the upper bound on the sum of cycle lengths.

The next line contains n integers a_1, a_2, ..., a_n—elements of the array (1 ≤ a_i ≤ 10^9).

Output

If it's impossible to sort the array using cycles of total length not exceeding s, print a single number "-1" (quotes for clarity).

Otherwise, print a single number q— the minimum number of operations required to sort the array.

On the next 2 ⋅ q lines print descriptions of operations in the order they are applied to the array. The description of i-th operation begins with a single line containing one integer k (1 ≤ k ≤ n)—the length of the cycle (that is, the number of selected indices). The next line should contain k distinct integers i_1, i_2, ..., i_k (1 ≤ i_j ≤ n)—the indices of the cycle.

The sum of lengths of these cycles should be less than or equal to s, and the array should be sorted after applying these q operations.

If there are several possible answers with the optimal q, print any of them.

Examples

Input

5 5
3 2 3 1 1


Output

1
5
1 4 2 3 5 


Input

4 3
2 1 4 3


Output

-1

Input

2 0
2 2


Output

0

Note

In the first example, it's also possible to sort the array with two operations of total length 5: first apply the cycle 1 → 4 → 1 (of length 2), then apply the cycle 2 → 3 → 5 → 2 (of length 3). However, it would be wrong answer as you're asked to use the minimal possible number of operations, which is 1 in that case.

In the second example, it's possible to the sort the array with two cycles of total length 4 (1 → 2 → 1 and 3 → 4 → 3). However, it's impossible to achieve the same using shorter cycles, which is required by s=3.

In the third example, the array is already sorted, so no operations are needed. Total length of empty set of cycles is considered to be zero.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int N, S;
int A[200020], B[200020];
vector<int> vx;
int pp[200020];
int Find(int x) { return pp[x] == x ? x : pp[x] = Find(pp[x]); }
vector<int> vs[2][200020];
int nxt[200020];
int main() {
  scanf("%d%d", &N, &S);
  for (int i = 1; i <= N; i++) scanf("%d", A + i);
  for (int i = 1; i <= N; i++) vx.push_back(A[i]);
  sort(vx.begin(), vx.end());
  vx.resize(unique(vx.begin(), vx.end()) - vx.begin());
  for (int i = 1; i <= N; i++)
    A[i] = (int)(lower_bound(vx.begin(), vx.end(), A[i]) - vx.begin() + 1);
  for (int i = 1; i <= N; i++) B[i] = A[i];
  sort(B + 1, B + 1 + N);
  int cnt = 0;
  for (int i = 1; i <= N; i++)
    if (B[i] != A[i]) ++cnt;
  if (cnt > S) {
    puts("-1");
    return 0;
  }
  for (int i = 1; i <= N; i++) pp[i] = i;
  for (int i = 1; i <= N; i++)
    if (A[i] != B[i]) {
      vs[0][A[i]].push_back(i);
      vs[1][B[i]].push_back(i);
    }
  int L = (int)vx.size();
  for (int i = 1; i <= L; i++) {
    int n = (int)vs[0][i].size();
    for (int j = 0; j < n; j++) {
      int x = vs[0][i][j], y = vs[1][i][j];
      nxt[x] = y;
      int px = Find(x), py = Find(y);
      if (px != py) pp[px] = py;
    }
  }
  for (int i = 1; i <= L; i++) {
    int n = (int)vs[0][i].size();
    for (int j = 1; j < n; j++) {
      int x = vs[0][i][0];
      int y = vs[0][i][j];
      int px = Find(x), py = Find(y);
      if (px != py) {
        swap(nxt[x], nxt[y]);
        pp[px] = py;
      }
    }
  }
  int c[200020] = {};
  for (int i = 1; i <= N; i++) c[Find(i)]++;
  vector<pair<int, int> > v;
  for (int i = 1; i <= N; i++)
    if (pp[i] == i && A[i] != B[i]) v.push_back(pair<int, int>(c[i], i));
  sort(v.begin(), v.end());
  reverse(v.begin(), v.end());
  S -= cnt;
  vector<vector<int> > ans;
  if (S > 2 && (int)v.size() > 2) {
    int r = min(S, (int)v.size());
    int save = nxt[v[0].second];
    for (int i = 0; i < r - 1; i++) nxt[v[i].second] = nxt[v[i + 1].second];
    nxt[v[r - 1].second] = save;
    vector<int> nv;
    for (int i = 0; i < r; i++) nv.push_back(v[i].second);
    reverse(nv.begin(), nv.end());
    ans.push_back(nv);
    for (int i = 1; i < r; i++) pp[Find(v[i].second)] = Find(v[0].second);
  }
  for (int i = 1; i <= N; i++)
    if (A[i] != B[i] && pp[i] == i) {
      vector<int> v;
      v.push_back(i);
      for (int t = nxt[i]; t != i; t = nxt[t]) {
        v.push_back(t);
      }
      ans.push_back(v);
    }
  printf("%d\n", (int)ans.size());
  for (auto e : ans) {
    printf("%d\n", (int)e.size());
    for (int f : e) printf("%d ", f);
    puts("");
  }
  return 0;
}

```