#include <bits/stdc++.h>

using namespace std;

int main()
{
    vector<int> v(4);
    vector<int> u(4);
    long long N;
    scanf("%d%d%d%d%lld", &v[0], &v[1], &v[2], &v[3], &N);
    u[0] = v[0];
    u[1] = u[2] = u[3] = 0;
    int st = N % 4;

    auto op = [&](int x)
    {
        u[(x + 1) % 4] += u[x];
        u[x] = 0;
        if (u[(x + 1) % 4] > v[(x + 1) % 4])
        {
            u[x] = u[(x + 1) % 4] - v[(x + 1) % 4];
            u[(x + 1) % 4] = v[(x + 1) % 4];
        }
    };

    auto r = [&]()
    {
        op(st);
        op((st + 1) % 4);
        op((st + 2) % 4);
        op((st + 3) % 4);
    };

    for (int i = 0; i < (N % 4); i++)
        op(i);
    
    N /= 4;

    map<vector<int>, int> M;
    int cur = 0;
    while (N > 0)
    {
        if (M.count(u))
        {
            N %= cur - M[u];
            break;
        }
        M[u] = cur++;
        r();
        --N;
    }
    while (N > 0)
        r(), N--;
    printf("%d %d %d %d\n", u[0], u[1], u[2], u[3]);
}