import bisect,sys
input = sys.stdin.readline
n = int(input())
a = list(map(int,input().split()))
q = int(input())
b = [0 for i in range(n+1)]
for i in range(n):
    b[i+1] = b[i] + a[i]
s = sum(a)

for i in range(q):
    y,m,d,k = map(int,input().split())
    x = s * y + b[m-1] + d-1
    x += k
    

    y = x // s
    x %= s

    m = bisect.bisect_right(b,x)-1

    if m == -1:
        print(y-1,n-1,a[-1])
        continue

    x -= b[m]
    print(y,m+1,x+1)