import bisect
N = int(input())
D = list(map(int,input().split()))
S = [0]
for i in range(N):
    S.append(S[-1] + D[i])
for i in range(N):
    S.append(S[-1] + D[i])

SUM = sum(D)
Q = int(input())
for _ in range(Q):
    y,m,d,k = list(map(int,input().split()))
    y -= 1;m -= 1;d -= 1
    
    tmp = y * SUM + S[m] + d + k
    Y = tmp//SUM
    tmp %= SUM
    M = bisect.bisect_right(S,tmp) - 1
    tmp -= S[M]
    print(Y+1,M+1,tmp+1)