#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define REP(i,n) for (int i = 0; i<n; ++i)
#define RREP(i,n) for (int i = n-1; i>=0; --i)
#define REP1(i,n) for (int i = 1; i<=n; ++i)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif
const int iinf = 1e9+10;
const ll inf = 1ll<<60;
const ll mod = 1e9+7 ;
void GG(){cout<<"-1\n"; exit(0);}
ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
ll re=1;
while (n>0){
if (n&1) re = re*a %mo;
a = a*a %mo;
n>>=1;
}
return re;
}
ll inv (ll b, ll mo = mod){
if (b==1) return b;
return (mo-mo/b) * inv(mo%b,mo) % mo;
}
const int maxn = 1e6+5;
bool g[10000][51];
int tall[51];
int nof[51]; // modulo k
//bool org[51][51];
int a[51];
int n,K;
vector<pii> re;
void tryclear(){
int hei = *max_element(tall, tall+n);
for (int i = 0; i<hei; ++i) {
if (*min_element(g[i], g[i]+n) ) {
for (int j = i; j<hei; ++j) {
for(int k = 0; k<n; ++k) g[j][k] = g[j+1][k];
}
--hei;
for (int k = 0; k<n; ++k) {
--nof[k]; if (nof[k] < 0) nof[k] += K;
while (tall[k] && !g[tall[k]-1][k]) --tall[k];
}
--i;
}
}
}
void dump(){
#ifndef BALBIT
return;
#endif
for (int i = 6; i>=0; --i) {
for (int j = 0; j<n; ++j) {
cout<<g[i][j];
}
cout<<'\n';
}
cout<<endl;
}
bool addh(int l) {
re.pb({2,l+1});
int r = l+K-1;
if (r >= n) return 0;
bug(l,r);
int m = *max_element(tall+l, tall+r+1);
for (int i = l; i<=r; ++i) {
tall[i] = m+1;
g[m][i] = 1;
(++nof[i]) %= K;
}
return 1;
}
void addv(int l) {
re.pb({1,l+1});
REP(i,K) {
g[i+tall[l]][l] = 1;
}
tall[l] += K;
tryclear();
}
signed main(){
IOS();
cin>>n>>K;
REP(i,n) {
cin>>a[i];
}
dump();
REP(kkk, K) {
re.clear();
memset(g, 0, sizeof g);
REP(i,n) {
tall[i] = a[i];
nof[i] = (kkk+tall[i]) % K;
for (int j = 0; j<tall[i]; ++j) g[j][i] = 1;
}
bool ok = 1;
REP(i,n) {
while (nof[i] != 0) {
if (!addh(i)) {ok = 0; break;}
}
if (!ok) break;
dump();
}
bug(kkk, ok);
dump();
if (ok) {
bug(kkk);
// dump();
// assert(0);
break;
}
if (kkk == K-1) {
GG();
}
}
while (*max_element(tall, tall+n)) {
int h = 10000000, pos = -1;
REP(i,n) {
if (tall[i] < h) {
h = tall[i]; pos = i;
}
}
addv(pos);
bug(pos, h);
dump();
tryclear();
dump();
string foo; cin>>foo;
}
cout<<SZ(re)<<endl;
for (auto & p : re) {
cout<<p.f<<' '<<p.s<<endl;
}
}
