#if __has_include(<pch/all.h>)
#include <pch/all.h>
#else
#include <bits/stdc++.h>
#include <atcoder/all>
#endif

using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No")
#define SORT(v) sort(v.begin(), v.end())
#define RSORT(v) sort(v.rbegin(), v.rend())
#define REVERSE(v) reverse(v.begin(), v.end())

template <typename Container>
void printVector(const Container &v, char delimiter = ' ')
{
    for (auto itr = v.begin(); itr != v.end(); itr++)
    {
        if (itr != v.begin())
        {
            cout << delimiter;
        }
        cout << *itr;
    }
    cout << endl;
}

template <typename Container>
void printlnVector(const Container &v)
{
    printVector(v, '\n');
}

void solve()
{
    int N = 7;
    vector<int> T(N);
    rep(i, N)
    {
        cin >> T[i];
        if (T[i] == -1)
        {
            T[i] = INT32_MAX;
        }
    }

    // SORT(T);
    long long ans = 6000;

    rep(i, N)
    {
        if (T[i] == INT32_MAX)
        {
            ans = -1;
        }

        ans -= T[i];
        ans = max(ans, -1ll);

        cout << ans << endl;
    }
}

int main()
{
    int T = 1;
    // cin >> T;

    while (T--)
    {
        solve();
    }

    return 0;
}