#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n; cin >> n;
	vector<long long>d(n), sd(n + 1);
	rep(i, n)cin >> d[i];
	rep(i, n)sd[i + 1] = sd[i] + d[i];

	long long one = 0;
	rep(i, n)one += d[i];
	auto f = [&](long long m, long long d)->long long {
		long long ret = sd[m] - sd[0] + d;
		return ret;
	};
	int q; cin >> q;
	while (q--) {
		long long y, m, d, k;
		cin >> y >> m >> d >> k;
		m--, d--;
		long long x = k + f(m, d);
		y += x / one;
		x %= one;
		{
			int val = upper_bound(all(sd), x) - sd.begin();
			m = val;
			x -= sd[val - 1];
			d = x + 1;
		}
		cout << y << " " << m << " " << d << endl;
	}
	return 0;
}