import bisect

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

Q = int(input())
for _ in range(Q):
	y, m, d, k = map(int, input().split())
	d += k
	
	d += D[m - 1]
	y += (d - 1) // D[-1]
	d -= (d - 1) // D[-1] * D[-1]
	
	m = bisect.bisect_left(D, d)
	d -= D[m - 1]
	
	print(y, m, d)