from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right, insort
from itertools import permutations, combinations, groupby
from heapq import heappop, heappush
import math, sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
def printl(li, sep=" "): print(sep.join(map(str, li)))
def yn(flag): print(Yes if flag else No)
_int = lambda x: int(x)-1
MOD = 998244353 #10**9+7
INF = 1<<60
Yes, No = "Yes", "No"

N = 7
T = list(map(int, input().split()))
s = 0
t = 0
for i in range(N):
    s += T[i]
    if T[i] == -1:
        t = 1
    if s > 6000 or t:
        print(-1)
    else:
        print(6000-s)