#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
const double EPS = 1e-9;
const double PI = acos(-1.0);
const int INF = (1LL << 29);
using namespace std;
template <typename T>
string toString(T t) {
  stringstream ss;
  ss << t;
  return ss.str();
}
int main() {
  int n, k;
  cin >> n >> k;
  vector<int> a(n, 0);
  for (int i = 0; i < n; i++) cin >> a[i];
  int s = n, sol = 0;
  for (int i = 0; i < n; i++) {
    int curr = 0;
    for (int j = i - 1; j >= 0; j--) {
      if (a[j] - a[i] != (j - i) * k) curr++;
    }
    for (int j = i + 1; j < n; j++) {
      if (a[i] - a[j] != (i - j) * k) curr++;
    }
    bool valid = true;
    for (int j = 0; j < n; j++) {
      if (a[i] + (j - i) * k <= 0) valid = false;
    }
    if (valid && curr < s) {
      s = curr;
      sol = i;
    }
  }
  cout << s << endl;
  for (int j = 0; j < n; j++) {
    int diff = a[j] - a[sol] - (j - sol) * k;
    if (diff < 0) {
      cout << "+ ";
      diff = -diff;
    } else if (diff > 0) {
      cout << "- ";
    }
    if (diff != 0) cout << j + 1 << " " << diff << endl;
  }
  return 0;
}
