#include <bits/stdc++.h>
using namespace std;
int main() {
  int a[1001], b[1001], c[1001];
  int n, m;
  while (cin >> n >> m) {
    memset(c, 0, sizeof(c));
    memset(b, 0, sizeof(b));
    for (int i = 0; i < n; i++) {
      scanf("%d", &a[i]);
    }
    for (int i = 0; i < n; i++) {
      int count = 0;
      for (int j = 0; j < i; j++) {
        b[j] = a[i] - m * (i - j);
      }
      for (int j = i; j < n; j++) {
        b[j] = a[i] + m * (j - i);
      }
      for (int j = 0; j < n; j++) {
        if (b[j] != a[j]) {
          count++;
        }
        if (b[0] <= 0) {
          count = 99999999;
        }
      }
      c[i] = count;
    }
    int minn = 99999999;
    int k;
    for (int i = 0; i < n; i++) {
      if (c[i] < minn) {
        minn = c[i];
        k = i;
      }
    }
    for (int j = 0; j < k; j++) {
      b[j] = a[k] - m * (k - j);
    }
    for (int j = k; j < n; j++) {
      b[j] = a[k] + m * (j - k);
    }
    cout << minn << endl;
    for (int i = 0; i < n; i++) {
      int num;
      if (b[i] != a[i]) {
        num = b[i] - a[i];
        if (num < 0) {
          cout << "- " << i + 1 << " " << -num << endl;
        } else {
          cout << "+ " << i + 1 << " " << num << endl;
        }
      }
    }
  }
  return 0;
}
