#include <bits/stdc++.h>
#define sz(x) ((int)x.size())
#define pii pair<int, int>
#define ft first
#define sd second
#define MP make_pair
#define PB push_back
using namespace std;
typedef long long ll;
const int oo = 2e9;
const ll OO = 1e18;
const int N = 1000100;
set<pii, greater<pii> > st;
vector<vector<int> > ans;
vector<int> vc;
int n, k, sm;
ll a[N];
void BAD(){
cout << -1;
exit(0);
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n >> k;
bool ok = 1;
for (int i = 0; i < n; i++){
cin >> a[i];
if (i > 0)
ok &= bool(a[i] == a[i - 1]);
}
if (ok){
return -1;
int kl = k / __gcd(n, k);
if (a[0] % kl == 0){
int bd = kl * n;
for (int it = 0; it < bd; it += k){
vc.clear();
for (int lit = 0; lit < k; lit++){
int ps = (it + lit) % n;
vc.PB(ps);
}
ans.PB(vc);
}
cout << sz(ans) << '\n';
for (int it = 0; it < sz(ans); it++){
cout << a[0] / kl;
for (int x : ans[it])
cout << " " << x + 1;
cout << '\n';
}
} else {
cout << -1;
}
return 0;
}
for (int i = 0; i < n; i++){
sm += a[i];
st.insert(MP(a[i], i));
}
while (sm > 0){
vc.clear();
for (int it = 0; it < k; it++){
pii cr = (*st.begin());
st.erase(st.begin());
if (cr.ft == 0)
BAD();
a[cr.sd]--;
sm--;
vc.PB(cr.sd);
}
ans.PB(vc);
for (int x : vc)
st.insert(MP(a[x], x));
}
cout << sz(ans) << '\n';
for (int it = 0; it < sz(ans); it++){
cout << "1";
for (int x : ans[it])
cout << " " << x + 1;
cout << '\n';
}
return 0;
}
