from bisect import bisect_left
N=int(input())
D=list(map(int,input().split()))
sumD=sum(D)
sm=[0]
for d in D+D:
    sm.append(sm[-1]+d)
Q=int(input())
for _ in range(Q):
    y,m,d,k=map(int,input().split())
    m-=1;d-=1

    y+=k//sumD
    k%=sumD

    i1=bisect_left(sm,sm[m]+d+1+k)
    i2=bisect_left(sm,sm[m]+d+1)
    if k-(sm[i1-1]-sm[i2])>=0:
        k-=sm[i1-1]-sm[i2]
    d+=k
    if d>=D[m]:
        d-=D[m];m+=1
    #if i1>N:y+=1
    m+=i1-1-i2
    if m>=N:
        y+=1;m-=N
    print(y,m+1,d+1)