#include<bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define mp make_pair
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
template<typename T,typename U>
T ceil(T x, U y) {return (x>0?(x+y-1)/y:x/y);}
template<typename T,typename U>
T floor(T x, U y) {return (x>0?x/y:(x-y+1)/y);}
template<class T,class S>
bool chmax(T &a,const S b) {return (a<b?a=b,1:0);}
template<class T,class S>
bool chmin(T &a,const S b) {return (a>b?a=b,1:0);}
int popcnt(int x) {return __builtin_popcount(x);}
int popcnt(ll x)  {return __builtin_popcountll(x);}
int topbit(int x) {return (x==0?-1:31-__builtin_clz(x));}
int topbit(ll x)  {return (x==0?-1:63-__builtin_clzll(x));}
int lowbit(int x) {return (x==0?-1:__builtin_ctz(x));}
int lowbit(ll x)  {return (x==0?-1:__builtin_ctzll(x));}

#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
typedef pair<int,int> pii; 
typedef vector<int> vi;
typedef vector<pii> vp;
typedef tuple<int,int,int> tiii;
int read() {
  int x=0,w=1; char c=getchar(); 
  while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
  while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();}
  return x*w;
}

const int N=55;
int n,k,a[N],b[N],mx;
vp ans;

void clear() {
  int mn=a[1];
  rep(i,1,n) chmin(mn,a[i]);
  rep(i,1,n) a[i]-=mn;
}
void oper(int x,int y) {
  if(x==1) a[y]+=k;
  else rep(j,y,y+k-1) a[j]++;
  clear(); ans.eb(x,y);
}

signed main() {
  n=read(), k=read();
  rep(i,1,n) a[i]=read(), b[(i-1)%k]+=a[i];
  rep(i,0,n%k-1) if(b[i]!=b[0]) return puts("-1"), 0;
  rep(i,n%k,k-1) if(b[i]!=b[n%k]) return puts("-1"), 0;
  clear();
  rep(i,2,n) while(a[i]<a[i-1]) oper(1,i);
  rep(i,k,n-1) while(a[i]!=a[i+1]) {
    int x=i;
    while(x>=k) oper(2,x-k+1), x-=k;
  }
  rep(i,1,k-1) {
    for(int mx=0;;mx=0) {
      rep(j,1,n) chmax(mx,a[j]);
      if(a[i]>=mx) break;
      oper(1,i);
    }
  }
  int p=(n%k==0?k:n%k);
  int mx=0; rep(i,p+1,k-1) chmax(mx,a[i]);
  rep(i,1,n) {
    int tm=(mx-a[i]+k-1)/k;
    rep(j,1,tm) oper(1,i);
  }
  mx=0; rep(i,1,p) chmax(mx,a[i]);
  rep(i,1,p) {
    int tm=(mx-a[i]+k-1)/k;
    rep(j,1,tm) oper(1,i);
  }
  for(int i=n%k+1;i<n;i+=k) {
    rep(j,1,mx) oper(2,i);
  }
  rep(i,1,n) assert(a[i]==0);
  printf("%d\n",(int)ans.size());
  for(auto [x,y]:ans) printf("%d %d\n",x,y);
  return 0;
}