#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

const int N = 55;

int n, k;
int a[N], d[N];
vector<int> v[N];
vector<pair<int, int>> ans;

void Adjust () {
  int mx = 0;
  for (int i = 1; i <= n; ++i) {
    mx = max(mx, a[i] / k);
  }
  for (int i = 1; i <= n; ++i) {
    while (a[i] < mx * k) {
      ans.push_back({1, i});
      a[i] += k; 
    }
    a[i] -= mx * k;
  }
}

void Operate (int x, int v) {
  if (!v) return; 
  d[x] = (d[x] + v) % k; 
  d[x + k] = (d[x + k] - v + k) % k;
  for (int i = 1; i <= v; ++i) {
    ans.push_back({2, x});
  }  
  for (int i = 1; i <= n; ++i) {
    if (i < x || i >= x + k) {
      ans.push_back({1, i});
      ans.push_back({1, i});
      a[i] += k * 2 - v; 
    }
  }
  Adjust();
}

int main () {
  // freopen("tmp.in", "r", stdin);
  // freopen("tmp.out", "w", stdout);
  cin.tie(0)->sync_with_stdio(0);
  cin >> n >> k;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
  }
  Adjust();
  for (int i = 1; i <= n + 1; ++i) {
    d[i] = (a[i] - a[i - 1] + k) % k;
    v[i % k].push_back(i);
  }
  for (int r = 0; r < k; ++r) {
    if (v[r].empty()) continue;
    int sum = 0; 
    for (auto i : v[r]) {
      sum = (sum + d[i]) % k; 
    }
    if (v[r][0] == 1) {
      for (int j = v[r].size() - 1; j; --j) {
        Operate(v[r][j - 1], d[v[r][j]]);
      }
    }
    else {
      if (sum && v[r].back() != n + 1) {
        cout << -1 << '\n';
        return 0; 
      }
      for (int j = 0; j < v[r].size() - 1; ++j) {
        int i = v[r][j];
        Operate(i, (k - d[i]) % k);
      }
    }
  }
  int mx = *max_element(a + 1, a + n + 1);
  for (int i = 1; i <= n; ++i) {
    int cnt = (mx - a[i]) / k; 
    for (int j = 1; j <= cnt; ++j) {
      ans.push_back({1, i});
    }
  }
  cout << ans.size() << '\n';
  for (auto i : ans) {
    cout << i.first << ' ' << i.second << '\n';
  }
  return 0; 
}