cf 402b Trees in a Row

这一个就是找一个最小的操作数，使这个序列成为等差序列，直接暴力这个k的范围

找一遍看看使a[1]分别赋值这个，然后去找a[2]到a[n]，然后a[1]循环加+k 看有多少个不同，最后直接取一个最小，留下那个对应的a[1]的大小

The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height a_i meters. Today the Queen decided to update the scenery of her garden. She wants the trees' heights to meet the condition: for all i (1 ≤ i < n), a_i + 1 - a_i = k, where k is the number the Queen chose.

Unfortunately, the royal gardener is not a machine and he cannot fulfill the desire of the Queen instantly! In one minute, the gardener can either decrease the height of a tree to any positive integer height or increase the height of a tree to any positive integer height. How should the royal gardener act to fulfill a whim of Her Majesty in the minimum number of minutes?

Input

The first line contains two space-separated integers: n, k (1 ≤ n, k ≤ 1000). The second line contains n space-separated integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 1000) — the heights of the trees in the row.

Output

In the first line print a single integer p — the minimum number of minutes the gardener needs. In the next p lines print the description of his actions.

If the gardener needs to increase the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, then print in the corresponding line "+ j x". If the gardener needs to decrease the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, print on the corresponding line "- j x".

If there are multiple ways to make a row of trees beautiful in the minimum number of actions, you are allowed to print any of them.

Example

Input

4 1
1 2 1 5

Output

2
+ 3 2
- 4 1

Input

4 1
1 2 3 4

Output

0

#include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;

const int maxn = 1000 + 10;
int a[maxn];

int main()
{
    int n, k, i, j;
    while (scanf("%d%d", &n, &k) != EOF)
    {
        for (i = 1; i <= n; i++)
            scanf("%d", &a[i]);
        int p, tmp, cnt, mini;
        mini = maxn;
        for (i = 1; i <= 1000; i++)
        {
            tmp = i, cnt = 0;
            for (j = 1; j <= n; j++)
            {
                if (a[j] != tmp)
                    cnt++;
                tmp += k;
            }
            if (cnt <= mini)
            {
                mini = cnt;
                p = i;
            }
        }
        printf("%d\n", mini);
        for (i = 1; i <= n; i++)
        {
            if (p != a[i])
            {
                if (p > a[i])
                    printf("+ %d %d\n", i, p-a[i]);
                else
                    printf("- %d %d\n", i, a[i]-p);
            }
            p += k;
        }
    }
    return 0;
}