from bisect import bisect_right

n = int(input())
d = list(map(int, input().split()))

ps = [0] * (n + 1)
for i in range(n):
    ps[i + 1] = ps[i] + d[i]
    S = ps[-1]  

q = int(input())

for _ in range(q):
    y, m, d, k = map(int, input().split())

    t = ps[m - 1] + (d - 1)
    
    t2 = t + k
    y2 = y + (t2 // S)  
    r = t2 % S

    m2 = bisect_right(ps, r)
    d2 = r - ps[m2 - 1] + 1

    print(y2, m2, d2)