#include <bits/stdc++.h>
using namespace std;
const long long N = 200005;
template <class T1, class T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &a) {
  return os << '(' << a.first << ", " << a.second << ')';
}
template <class T>
ostream &operator<<(ostream &os, const vector<T> &a) {
  os << '[';
  for (unsigned long long i = 0; i < a.size(); i++)
    os << a[i] << (i < a.size() - 1 ? ", " : "");
  os << ']';
  return os;
}
long long read() {
  long long x;
  cin >> x;
  return x;
}
struct dsu {
  vector<long long> par, sz;
  long long cc;
  void init(long long n) {
    par.assign(n + 5, 0);
    sz.assign(n + 5, 0);
    cc = n;
    for (long long i = 0; i < n + 5; i++) par[i] = i, sz[i] = 1;
  }
  long long find(long long x) {
    if (par[x] == x) return x;
    return par[x] = find(par[x]);
  }
  void uni(long long x, long long y) {
    x = find(x);
    y = find(y);
    if (x != y) {
      sz[y] += sz[x];
      sz[x] = 0;
      par[x] = y;
      cc--;
    }
  }
} d;
long long n, m;
vector<pair<long long, long long> > a, b;
long long out[N], in[N];
void addEdge(long long u, long long v) {
  out[u] = v;
  in[v] = u;
  d.uni(u, v);
}
void con(long long u, long long v) {
  long long outu = out[u], outv = out[v];
  addEdge(u, outv);
  addEdge(v, outu);
}
void noAnswer() {
  cout << -1 << '\n';
  exit(0);
}
vector<vector<long long> > ans;
void makeAns() {
  vector<bool> used(N, 0);
  for (long long i = (long long)0; i <= (long long)n - 1; i++) {
    long long u = d.find(i);
    if (d.sz[u] == 1 || used[u]) continue;
    used[u] = true;
    long long root = u;
    vector<long long> cur;
    cur.push_back(u);
    while (out[u] != root) {
      u = out[u];
      cur.push_back(u);
    }
    ans.push_back(cur);
  }
  cout << ans.size() << '\n';
  for (auto &it : ans) {
    cout << it.size() << '\n';
    for (auto &it2 : it) cout << it2 + 1 << ' ';
    cout << '\n';
  }
  exit(0);
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  d.init(n);
  set<pair<long long, long long> > st;
  vector<long long> _a;
  for (long long i = (long long)1; i <= (long long)n; i++) {
    pair<long long, long long> it = make_pair(read(), i - 1);
    a.push_back(it);
    st.insert(it);
    _a.push_back(it.first);
  }
  sort(_a.begin(), _a.end());
  for (long long i = (long long)0; i <= (long long)n - 1; i++)
    if (_a[i] == a[i].first) st.erase(a[i]);
  for (long long i = (long long)0; i <= (long long)n - 1; i++) {
    if (_a[i] == a[i].first)
      b.push_back(a[i]);
    else {
      auto it = st.lower_bound(make_pair(_a[i], -1));
      b.push_back(*it);
      st.erase(it);
      addEdge(b[i].second, i);
    }
  }
  pair<long long, long long> last = make_pair(-1, -1);
  for (long long i = (long long)0; i <= (long long)b.size() - 1; i++) {
    auto &it = b[i];
    if (d.sz[d.find(it.second)] == 1) continue;
    if (last.first != -1 && last.first == it.first &&
        d.find(last.second) != d.find(it.second))
      con(last.second, it.second);
    last = it;
  }
  vector<bool> used(N, 0);
  vector<long long> all;
  long long sz = 0;
  for (long long i = (long long)0; i <= (long long)n - 1; i++) {
    long long u = d.find(i);
    if (d.sz[u] == 1 || used[u]) continue;
    used[u] = true;
    sz += d.sz[u];
    all.push_back(u);
  }
  if (sz > m) noAnswer();
  m -= sz;
  m = min(m, (long long)all.size());
  if (m >= 3) {
    vector<long long> cur;
    for (long long i = (long long)0; i <= (long long)m - 1; i++) {
      if (!cur.empty()) con(cur.front(), all[i]);
      cur.push_back(all[i]);
    }
    ans.push_back(cur);
  }
  makeAns();
}

### Prompt

Please create a solution in Cpp to 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;
const long long N = 200005;
template <class T1, class T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &a) {
  return os << '(' << a.first << ", " << a.second << ')';
}
template <class T>
ostream &operator<<(ostream &os, const vector<T> &a) {
  os << '[';
  for (unsigned long long i = 0; i < a.size(); i++)
    os << a[i] << (i < a.size() - 1 ? ", " : "");
  os << ']';
  return os;
}
long long read() {
  long long x;
  cin >> x;
  return x;
}
struct dsu {
  vector<long long> par, sz;
  long long cc;
  void init(long long n) {
    par.assign(n + 5, 0);
    sz.assign(n + 5, 0);
    cc = n;
    for (long long i = 0; i < n + 5; i++) par[i] = i, sz[i] = 1;
  }
  long long find(long long x) {
    if (par[x] == x) return x;
    return par[x] = find(par[x]);
  }
  void uni(long long x, long long y) {
    x = find(x);
    y = find(y);
    if (x != y) {
      sz[y] += sz[x];
      sz[x] = 0;
      par[x] = y;
      cc--;
    }
  }
} d;
long long n, m;
vector<pair<long long, long long> > a, b;
long long out[N], in[N];
void addEdge(long long u, long long v) {
  out[u] = v;
  in[v] = u;
  d.uni(u, v);
}
void con(long long u, long long v) {
  long long outu = out[u], outv = out[v];
  addEdge(u, outv);
  addEdge(v, outu);
}
void noAnswer() {
  cout << -1 << '\n';
  exit(0);
}
vector<vector<long long> > ans;
void makeAns() {
  vector<bool> used(N, 0);
  for (long long i = (long long)0; i <= (long long)n - 1; i++) {
    long long u = d.find(i);
    if (d.sz[u] == 1 || used[u]) continue;
    used[u] = true;
    long long root = u;
    vector<long long> cur;
    cur.push_back(u);
    while (out[u] != root) {
      u = out[u];
      cur.push_back(u);
    }
    ans.push_back(cur);
  }
  cout << ans.size() << '\n';
  for (auto &it : ans) {
    cout << it.size() << '\n';
    for (auto &it2 : it) cout << it2 + 1 << ' ';
    cout << '\n';
  }
  exit(0);
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  d.init(n);
  set<pair<long long, long long> > st;
  vector<long long> _a;
  for (long long i = (long long)1; i <= (long long)n; i++) {
    pair<long long, long long> it = make_pair(read(), i - 1);
    a.push_back(it);
    st.insert(it);
    _a.push_back(it.first);
  }
  sort(_a.begin(), _a.end());
  for (long long i = (long long)0; i <= (long long)n - 1; i++)
    if (_a[i] == a[i].first) st.erase(a[i]);
  for (long long i = (long long)0; i <= (long long)n - 1; i++) {
    if (_a[i] == a[i].first)
      b.push_back(a[i]);
    else {
      auto it = st.lower_bound(make_pair(_a[i], -1));
      b.push_back(*it);
      st.erase(it);
      addEdge(b[i].second, i);
    }
  }
  pair<long long, long long> last = make_pair(-1, -1);
  for (long long i = (long long)0; i <= (long long)b.size() - 1; i++) {
    auto &it = b[i];
    if (d.sz[d.find(it.second)] == 1) continue;
    if (last.first != -1 && last.first == it.first &&
        d.find(last.second) != d.find(it.second))
      con(last.second, it.second);
    last = it;
  }
  vector<bool> used(N, 0);
  vector<long long> all;
  long long sz = 0;
  for (long long i = (long long)0; i <= (long long)n - 1; i++) {
    long long u = d.find(i);
    if (d.sz[u] == 1 || used[u]) continue;
    used[u] = true;
    sz += d.sz[u];
    all.push_back(u);
  }
  if (sz > m) noAnswer();
  m -= sz;
  m = min(m, (long long)all.size());
  if (m >= 3) {
    vector<long long> cur;
    for (long long i = (long long)0; i <= (long long)m - 1; i++) {
      if (!cur.empty()) con(cur.front(), all[i]);
      cur.push_back(all[i]);
    }
    ans.push_back(cur);
  }
  makeAns();
}

```