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

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define ov4(a, b, c, d, name, ...) name
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)
#define fore(e, v) for (auto &&e : v)
#define all(a) begin(a), end(a)
#define sz(a) (int)(size(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back

template <typename T, typename S> bool chmin(T &a, const S &b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T, typename S> bool chmax(T &a, const S &b) {
  return a < b ? a = b, 1 : 0;
}
const int INF = 1e9 + 100;
const ll INFL = 3e18 + 100;
#define i128 __int128_t
struct _ {
  _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }
} __;

int main() {
  int N;
  cin >> N;
  vl A(N);
  fore(i, A) cin >> i;
  vl S(N * 2 + 1);
  rep(i, N * 2) S[i + 1] = S[i] + A[i % N];
  int Q;
  cin >> Q;
  ll year = S[N];
  rep(Q) {
    ll Y, M, D, K;
    cin >> Y >> M >> D >> K;
    Y += K / year;
    K %= year;
    --M;
    --D;
    if (D + K >= A[M]) {
      K -= A[M] - D;
      M += 1;
      D = 0;
      if (M == N)
        M = 0, Y++;
      int x = upper_bound(all(S), S[M] + K) - begin(S);
      --x;
      if (x >= N)
        Y++;
      D = K + S[M] - S[x];
      M = x % N;
    } else {
      D += K;
    }
    cout << Y << ' ' << M + 1 << ' ' << D + 1 << '\n';
  }
}