#define _USE_MATH_DEFINES #include using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(),(v).end() using ll = long long; constexpr int INF = 0x3f3f3f3f; constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL; constexpr double EPS = 1e-8; constexpr int MOD = 1000000007; // constexpr int MOD = 998244353; constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1}; constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}; constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1}; template inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; } template inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; } struct IOSetup { IOSetup() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << fixed << setprecision(20); } } iosetup; int main() { constexpr int N = 4; int v[N]; REP(i, N) cin >> v[i]; ll n; cin >> n; vector water(N, 0); water[0] = v[0]; map, int>, int> dp{{{water, N - 1}, 0}}; for (int i = 1; i <= n; ++i) { const int x = (i - 1) % N, mv = min(water[x], v[(x + 1) % N] - water[(x + 1) % N]); water[x] -= mv; water[(x + 1) % N] += mv; if (dp.count({water, x})) { n -= dp[{water, x}]; n %= i - dp[{water, x}]; const int y = dp[{water, x}] + n; for (const auto [w_x, itr] : dp) { if (itr == y) { REP(i, N) cout << w_x.first[i] << " \n"[i + 1 == N]; return 0; } } assert(false); } dp[{water, x}] = i; } REP(i, N) cout << water[i] << " \n"[i + 1 == N]; return 0; }