// #include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll inf = (1LL << 61);
ll dx[8] = {0, 1, 0, -1, 1, -1, -1, 1};
ll dy[8] = {-1, 0, 1, 0, 1, 1, -1, -1};
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define REP(i, init, n) for (ll i = (ll)init; i < (ll)(n); ++i)

int main() {
  ll n;
  cin >> n;
  vector<ll> d(n);
  vector<ll> s(2 * n + 1, 0);
  rep(i, n) cin >> d[i];
  rep(i, n) s[i + 1] = s[i] + d[i];
  rep(i, n) s[i + n + 1] = s[i + n] + d[i];
  ll sum = 0;
  rep(i, n) sum += d[i];
  ll q;
  cin >> q;
  rep(_, q) {
    ll y, m, D, k;
    cin >> y >> m >> D >> k;
    m--;
    ll ay = y + k / sum;
    ll rem = k % sum;
    auto to = lower_bound(s.begin(), s.end(), s[m] + D + rem) - s.begin() - 1;
    ll am = to % n;
    ll ad = -s[to] + (s[m] + D + rem);
    if (am < m || (am == m && ad < D)) ++ay;
    cout << ay << " " << am + 1 << " " << ad << "\n";
  }
}