#include <bits/stdc++.h>
struct Cuts {
  long long t[1000];
  int nonZero;
  Cuts() : nonZero(0) { memset(t, 0, sizeof(long long) * 1000); }
  void recountNonZero() {
    nonZero = 0;
    for (int i = 0; i < 1000; i++)
      if (t[i] != 0) nonZero++;
  }
  void subAll(int range, long long val) {
    for (int i = 0; i < range; i++) t[i] -= val;
    recountNonZero();
  }
  void print() const {
    std::cout << nonZero << std::endl;
    for (int i = 0; i < 1000; i++)
      if (t[i] != 0)
        std::cout << (t[i] > 0 ? "+ " : "- ") << (i + 1) << " "
                  << std::abs(t[i]) << std::endl;
  }
  long long& operator[](const int index) { return t[index]; }
};
struct Height {
  long long t[1000];
  Height() { memset(t, 0, sizeof(long long) * 1000); }
  long long& operator[](const int i) { return t[i]; }
};
int main() {
  int trees;
  long long K;
  Cuts minCuts;
  Height h, tmpH;
  std::ios_base::sync_with_stdio(false);
  std::cin >> trees >> K;
  for (int i = 0; i < trees; i++) std::cin >> h[i];
  tmpH = h;
  std::set<long long> uniqueCuts;
  minCuts[0] = 1 - tmpH[0];
  tmpH[0] = 1;
  uniqueCuts.insert(minCuts[0]);
  for (int i = 1; i < trees; i++) {
    minCuts[i] = tmpH[i - 1] + K - tmpH[i];
    tmpH[i] += minCuts[i];
    uniqueCuts.insert(minCuts[i]);
  }
  minCuts.recountNonZero();
  std::set<long long>::iterator it = uniqueCuts.begin(), end = uniqueCuts.end();
  while (it != end) {
    Cuts cuts = minCuts;
    cuts.subAll(trees, *it);
    if (cuts.nonZero < minCuts.nonZero) {
      bool valid = true;
      for (int i = 0; i < trees; i++)
        if (h[i] + cuts[i] <= 0) {
          valid = false;
          break;
        }
      if (valid) minCuts = cuts;
    }
    ++it;
  }
  for (int i = 1; i <= 1000; i++) {
    Cuts cuts = minCuts;
    cuts.subAll(trees, i);
    if (cuts.nonZero < minCuts.nonZero) {
      bool valid = true;
      for (int i = 0; i < trees; i++)
        if (h[i] + cuts[i] <= 0) {
          valid = false;
          break;
        }
      if (valid) minCuts = cuts;
    }
  }
  minCuts.print();
  return 0;
}
