#include <bits/stdc++.h>   using namespace std;   int main() {     long long int n, k, t, s, x, i, count;     vector<long long int> a;     vector<pair<long long int, pair<long long int, long long int> > > r;     cin >> n >> k;     for (int i = 0; i < n; i++) {       cin >> x;       a.push_back(x);     }     long long int mcount = -1;     long long int ind = 0;     for (long long int i = 0; i < n; i++) {       count = 1;       t = 1;       for (long long int j = i + 1; j < n; j++) {         if (a[j] == a[i] + t * k) count++;         t++;       }       if (count > mcount && a[i] > i * k) {         mcount = count;         ind = i;       }     }     vector<long long int> res(n);     res[ind] = a[ind];     for (long long int i = ind - 1; i >= 0; i--) {       res[i] = res[i + 1] - k;     }     for (long long int i = ind + 1; i < n; i++) {       res[i] = res[i - 1] + k;     }     for (long long int i = 0; i < n; i++) {       if (a[i] > res[i]) {         s = a[i] - res[i];         r.push_back(make_pair(-1, make_pair(i + 1, s)));       } else if (a[i] < res[i]) {         s = res[i] - a[i];         r.push_back(make_pair(1, make_pair(i + 1, s)));       }     }     cout << r.size() << endl;     for (int i = 0; i < (int)r.size(); i++) {       if (r[i].first == 1)         cout <<  +  ;       else         cout <<  -  ;       cout << r[i].second.first <<     << r[i].second.second << endl;     }     return 0;   }   