#include <bits/stdc++.h>

using namespace std;

int n, m, k, x;

int main()
{
    freopen("mulp.in", "r", stdin);
    freopen("mulp.out", "w", stdout);

    cin >> n >> k >> m;

    vector <long long> c;

    c.resize(n + k + 1);

    for (int i = 0; i < n; ++i)
    {
        cin >> x;
        c[i] = (c[i] - x + m) % m;
        c[i + k] = x;
    }

    for (int i = 0; i < n + k; ++i)
        cout << c[i] << " ";

    return 0;
}