#include<stdio.h>
long long int D[100005];
long long int sd[100005];
int main()
{
	long long int n;
	scanf("%lld", &n);
	long long int i;
	for (i = 0; i < n; i++)
		scanf("%lld", &D[i]);
	sd[0] = 0;
	for (i = 0; i < n; i++)
		sd[i + 1] = sd[i] + D[i];
	long long int q, y, m, d, k;
	scanf("%lld", &q);
	long long int min, mid, max;
	for (; q > 0; q--)
	{
		scanf("%lld %lld %lld %lld", &y, &m, &d, &k);
		k += sd[m - 1] + d - 1;
		y += k / sd[n];
		k %= sd[n];
		min = 0;
		max = n + 1;
		while (max - min > 1)
		{
			mid = (max + min) / 2;
			if (sd[mid] <= k)
				min = mid;
			else
				max = mid;
		}
		m = max;
		k -= sd[min];
		d = k + 1;
		printf("%lld %lld %lld\n", y, m, d);
	}
	return 0;
}