#include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::endl;
int getint() {
  int x;
  scanf("%d", &x);
  return x;
}
long long int getll() {
  long long int x;
  scanf("%lld", &x);
  return x;
}
const int MAXNKH = 1000 + 10;
const int LOC = 0;
const int MODIFY = 1;
int n, k, ans = 0x7f7f7f7f, ansf[MAXNKH][2], p, f[MAXNKH][2];
int height[MAXNKH];
int main() {
  n = getint();
  k = getint();
  for (int i = 1; i <= n; i += 1) height[i] = getint();
  for (int h1 = 1; h1 <= 1000; h1 += 1) {
    p = 0;
    memset(f, 0, sizeof f);
    for (int i = 1; i <= n; i += 1) {
      if (height[i] - (i - 1) * k != h1) {
        f[++p][LOC] = i;
        f[p][MODIFY] = (h1 + (i - 1) * k) - height[i];
      }
    }
    if (p < ans) {
      ans = p;
      memcpy(ansf, f, sizeof f);
    }
  }
  printf("%d\n", ans);
  for (int i = 1; i <= ans; i += 1)
    printf("%c %d %d\n", (ansf[i][MODIFY] < 0 ? '-' : '+'), ansf[i][LOC],
           std::abs(ansf[i][MODIFY]));
  return 0;
}
