#include "iostream"
#include "fstream"
#include "algorithm"
#include "iomanip"
#include "stack"
#include "queue"
#include "string"
#include "vector"
#include "map"
#include "set"
#include "unordered_set"
#include "unordered_map"
#include "iterator"
#include "cmath"
#include <cstdlib>
#include <ctime>
#include <stdio.h>

#define f(i,n) for(int i=0; i<n;i++)
#define rf(i, n) for(int i=n-1;i>=0;i--)
#define forn(i, j, n) for(int i=j; i<n; i++)

typedef long long ll;

#define int ll
const int sze = 1e6 + 10, psze = 30, INF = 1e18;

using namespace std;

int arr[sze];
int x[sze];
int y[sze];

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> n >> m;

    f(i, n)
    {
        cin >> arr[i];
    }

    x[0] = 0;

    for (int i = 1; i < n; i++)
    {
        x[i] = x[i - 1] + arr[i-1];
    }

    y[0] = m*arr[0];

    for (int i = 1; i < n; i++)
    {
        if (arr[i] <= arr[i - 1])
            y[i] = y[i - 1] + arr[i];
        else
            y[i] = x[i] + arr[i] * m;
    }

    f(i, n)
    {
        cout << y[i] << endl;
    }

    return 0;
}