Codeforces 732 B. Cormen — The Best Friend Of a Man [ 贪心 ]

B. Cormen — The Best Friend Of a Man

time limit per test : 1 second

memory limit per test : 256 megabytes

input : standard input

output : standard output

Recently a dog was bought for Polycarp. The dog's name is Cormen. Now Polycarp has a lot of troubles. For example, Cormen likes going for a walk.

Empirically Polycarp learned that the dog needs at least k walks for any two consecutive days in order to feel good. For example, if k = 5and yesterday Polycarp went for a walk with Cormen 2 times, today he has to go for a walk at least 3 times.

Polycarp analysed all his affairs over the next n days and made a sequence of n integers a1, a2, ..., an, where ai is the number of times Polycarp will walk with the dog on the i-th day while doing all his affairs (for example, he has to go to a shop, throw out the trash, etc.).

Help Polycarp determine the minimum number of walks he needs to do additionaly in the next n days so that Cormen will feel good during all the n days. You can assume that on the day before the first day and on the day after the n-th day Polycarp will go for a walk with Cormen exactly k times.

Write a program that will find the minumum number of additional walks and the appropriate schedule — the sequence of integers b1, b2, ..., bn (bi ≥ ai), where bi means the total number of walks with the dog on the i-th day.

Input

The first line contains two integers n and k (1 ≤ n, k ≤ 500) — the number of days and the minimum number of walks with Cormen for any two consecutive days.

The second line contains integers a1, a2, ..., an (0 ≤ ai ≤ 500) — the number of walks with Cormen on the i-th day which Polycarp has already planned.

Output

In the first line print the smallest number of additional walks that Polycarp should do during the next n days so that Cormen will feel good during all days.

In the second line print n integers b1, b2, ..., bn, where bi — the total number of walks on the i-th day according to the found solutions (ai ≤ bi for all i from 1 to n). If there are multiple solutions, print any of them.

Examples

input

Copy

3 5
2 0 1

output

Copy

4
2 3 2

input

Copy

3 1
0 0 0

output

Copy

1
0 1 0

input

Copy

4 6
2 4 3 5

output

Copy

0
2 4 3 5

题意：给定Polycarp的n天和Cormen的k walks，每两天至少k个walk,给定n天的事务a，求最少修改的次数以及修改后每天的次数。。

思路：直接计算就可以了，少的就直接加在后面。。

代码：

#include<iostream>
using namespace std;
const int maxn = 1e5+7;
int n, k , a[maxn], sum  = 0;



int main()
{
    scanf("%d%d",&n,&k);
    for(int i = 0; i < n; i++) scanf("%d",&a[i]);
    for(int i = 0; i < n - 1; i++)
    if(a[i] + a[i+1] >= k) continue;
    else {
            sum += (k - a[i] - a[i+1]);
            a[i+1] = (k - a[i]);
    }
    printf("%d\n",sum);
    printf("%d",a[0]);
    for(int i = 1; i < n; i++)
        printf(" %d",a[i]);
    printf("\n");
    return 0;
}