from itertools import accumulate
from bisect import bisect_right
n = int(input())
s = list(accumulate(map(int, input().split()), initial=0))
for _ in range(int(input())):
    y, m, d, k = map(int, input().split())
    m -= 1
    d -= 1
    v = s[-1] * y + s[m] + d + k
    y, v = divmod(v, s[-1])
    m = bisect_right(s, v) - 1
    d = v - s[m]
    print(y, m + 1, d + 1)