#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, a[1002], tmp[1002], ba, cnt, MIN = 10000, ans = -1, K[1002];
  scanf("%d %d", &n, &k);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &a[i]);
    K[i] = (i - 1) * k;
  }
  for (int i = 1; i <= n; ++i) {
    ba = a[i] - K[i];
    if (ba <= 0) continue;
    cnt = 0;
    for (int j = 1; j <= n; ++j) {
      if (a[j] != ba + K[j]) {
        ++cnt;
      }
      if (cnt >= MIN) {
        cnt = -1;
        break;
      }
    }
    if (cnt != -1) {
      if (cnt < MIN) {
        MIN = cnt;
        ans = i;
      }
    }
  }
  if (MIN == 0) {
    puts("0");
    return 0;
  }
  ba = a[ans] - K[ans];
  for (int i = 1; i <= n; ++i) tmp[i] = ba + K[i];
  printf("%d\n", MIN);
  for (int i = 1; i <= n; ++i)
    if (tmp[i] > a[i])
      printf("+ %d %d\n", i, tmp[i] - a[i]);
    else if (a[i] > tmp[i])
      printf("- %d %d\n", i, a[i] - tmp[i]);
}
