#include <bits/stdc++.h>

using namespace std;

constexpr int N = 2e5 + 10;

int n, s, a[N], b[N], tmp[N], to[N];
int head[N];

struct Edge {
    int to, nxt, id;
} e[N];

vector<int> p;

inline void add(int x, int y, int id) {e[id] = Edge{y, head[x], id}, head[x] = id;}

namespace DSU {
    int fa[N], sz[N], e[N];

    void init(int n) {for (int i = 1; i <= n; i++) fa[i] = i;}

    int find(int x) {
        if (x == fa[x]) return x;
        return fa[x] = find(fa[x]);
    }

    inline void merge(int x, int y, int id) {
        int fx = find(x), fy = find(y);
        if (fx != fy) {
            if (sz[fx] < sz[fy]) swap(fx, fy);
            fa[fy] = fx, sz[fx] += fy;
        }
        e[fx] = id;
    }
}

void dfs(int u) {
    while (head[u]) {
        int v = e[head[u]].to, id = e[head[u]].id; head[u] = e[head[u]].nxt;
        dfs(v); p.emplace_back(id);
    }
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(nullptr), cout.tie(nullptr);
    cin >> n >> s;
    for (int i = 1; i <= n; i++) cin >> a[i], tmp[i] = a[i];
    sort(tmp + 1, tmp + n + 1); int m = unique(tmp + 1, tmp + n + 1) - tmp - 1;
    if (m == 1) {cout << 0; return 0;}
    for (int i = 1; i <= n; i++) b[i] = a[i] = lower_bound(tmp + 1, tmp + m + 1, a[i]) - tmp;
    sort(b + 1, b + n + 1); int mink = 0; DSU::init(m);
    for (int i = 1; i <= n; i++) if (a[i] != b[i]) DSU::merge(a[i], b[i], i), mink++;
    if (!mink) {cout << 0; return 0;}
    if (s < mink) {cout << -1; return 0;};
    for (int i = 1; i <= m; i++) if (DSU::fa[i] == i && DSU::e[i]) p.emplace_back(DSU::e[i]);
    if (p.size() == 1) {
        for (int i = 1; i <= n; i++) if (a[i] != b[i]) add(a[i], b[i], i);
        p.clear();
        for (int i = 1; i <= m; i++) if (head[i]) {dfs(i); break;}
        cout << "1\n" << p.size() << '\n';
        for (int i : p) cout << i << ' ';
        return 0;
    }
    if (s > mink + 2) {
        int merge = min((int)p.size(), s - mink);
        cout << p.size() - merge + 2 << '\n' << merge << '\n';
        p.erase(p.begin() + merge, p.end());
        for (int i : p) cout << i << ' '; cout << '\n';
        int ap0 = a[p[merge - 1]];
        for (int i = merge - 1; i; i--) a[p[i]] = a[p[i - 1]];
        a[p[0]] = ap0;
    } else cout << p.size() << '\n';
    for (int i = 1; i <= n; i++) if (a[i] != b[i]) add(a[i], b[i], i);
    for (int i = 1; i <= m; i++) {
        if (head[i]) {
            p.clear(), dfs(i);
            cout << p.size() << '\n';
            for (int i : p) cout << i << ' '; cout << '\n';
        }
    }
    return 0;
}