#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,Q;
ll A[101010];
ll Y,M,D,K;
ll S[101010];
void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	FOR(i,N) {
		cin>>x;
		S[i+1]=S[i]+x;
	}
	cin>>Q;
	while(Q--) {
		cin>>Y>>M>>D>>K;
		Y+=K/S[N];
		K%=S[N];
		M--,D--;
		if(S[M]+D+K>=S[N]) {
			K=(S[M]+D+K)-S[N];
			Y++;
			M=D=0;
		}
		x=lower_bound(S,S+N+1,S[M]+D+K)-S;
		if(S[M]+D+K>=S[x]) {
			D=S[M]+D+K-S[x];
			M=x;
		}
		else {
			x--;
			D=S[M]+D+K-S[x];
			M=x;
		}
		
		cout<<Y<<" "<<M+1<<" "<<D+1<<endl;
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}