import sys, time, random, heapq, math, itertools, copy
from collections import deque, Counter, defaultdict
from sortedcontainers import SortedSet, SortedList
from bisect import bisect, bisect_left, bisect_right
import heapq as hq
from functools import cache, cmp_to_key
def debug(*x):print('debug:',*x, file=sys.stderr)
sys.setrecursionlimit(300000)
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 61 - 1
mod = 998244353
dir = [(0, 1), (0, -1), (1, 0), (-1, 0)]

T = li()
cnt = 0
flg = False
for i in range(7):
    if T[i] == -1:
        flg = True
    if flg or 6000 - T[i] - cnt < 0:
        print(-1)
        continue
    print(6000 - T[i] - cnt)
    cnt += T[i]