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



void solve(){
    int N; cin >> N;
    vector<ll> D(N);
    for(int i = 0; i < N; ++i) cin >> D[i];
    vector<ll> sumD(N + 1, 0);
    for(int i = 0; i < N; ++i) sumD[i + 1] = sumD[i] + D[i];
    int Q; cin >> Q;
    for(;Q--;){
        ll y, m, d, k; cin >> y >> m >> d >> k;
        k += d - 1;
        k += sumD[m - 1];
        y += k / sumD[N];
        k %= sumD[N];
        m = upper_bound(begin(sumD), end(sumD), k) - begin(sumD);
        k -= sumD[m - 1];
        cout << y << " " << m << " " << k + 1 << "\n";
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << setprecision(10) << fixed;

    int T;
    T = 1;
    //cin >> T;
    for(;T--;) solve();
}