#define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}
// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
public:
template<typename T>
_Debug& operator,(T val) {
cout << val << endl;
return *this;
}
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif
// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back
// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;
// ---------- END OF TEMPLATE ----------
int A[50],diff[51];
vpii sol;
int norm(int N,int K) {
int i;
while (1) {
for (i = 0; i < N; i++) {
if (A[i] >= K) break;
}
if (i < N) {
int m = 99;
for (i = 0; i < N; i++) {
if (A[i] == 0) {
sol.pb(mp(1,i+1));
A[i] += K;
}
m = min(m,A[i]);
}
for (i = 0; i < N; i++) A[i] -= m;
}
else break;
}
return 0;
}
int main() {
int i;
int N,K;
scanf("%d %d",&N,&K);
for (i = 0; i < N; i++) scanf("%d",&A[i]);
int j;
norm(N,K);
for (i = 1; i < N; i++) diff[i] = A[i-1]-A[i];
int s = 0;
for (i = K; i < N; i += K) s += diff[i];
for (i = 0; i <= N-K; i++) {
int m = 0;
for (j = i; j < i+K; j++) m = max(m,A[j]);
int x = ((i == 0) ? -s:diff[i]) % K;
if (x < 0) x += K;
for (j = 0; j < x; j++) sol.pb(mp(2,i+1));
diff[i+K] += x,m += x;
for (j = 0; j < N; j++) {
if ((j < i) || (j >= i+K)) {
while (A[j] < m) sol.pb(mp(1,j+1)),A[j] += K;
}
else A[j] += x;
}
m = 1e9;
for (j = 0; j < N; j++) m = min(m,A[j]);
for (j = 0; j < N; j++) A[j] -= m;
norm(N,K);
}
for (i = 0; i < N; i++) {
if (A[i] != 0) {
printf("-1\n");
return 0;
}
}
printf("%d\n",sol.size());
for (i = 0; i < sol.size(); i++) printf("%d %d\n",sol[i].first,sol[i].second);
return 0;
}
