n=int(input())
d=list(map(int,input().split()))
cd=[0]+d
for i in range(n):
  cd[i+1]+=cd[i]
Q=int(input())
from bisect import bisect_left
for _ in range(Q):
  y,m,d,k=map(int,input().split())
  x=y*cd[n]+cd[m-1]+d+k
  a=x//cd[n]
  x%=cd[n]
  if x>0:
    b=bisect_left(cd,x)
    c=x-cd[b-1]
  else:
    b=n
    c=cd[n]-cd[n-1]
  print(a,b,c)