#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define all(a) begin(a), end(a)
#define rep(i, s, e) for (int i = s; i < e; ++i)
#define asort(a) stable_sort(all(a))
#define rsort(a) stable_sort(rbegin(a), rend(a))
#define sum(a) reduce(all(a))
#define min_(a) reduce(all(a), *begin(a), [](auto x, auto y) { return min(x, y); })
#define max_(a) reduce(all(a), *begin(a), [](auto x, auto y) { return max(x, y); })
constexpr double degrees(double a) { return (a * 180.0) / M_PI; }
constexpr double radians(double a) { return (a * M_PI) / 180.0; }

int main(int, [[maybe_unused]] char* argv[]) {
#ifdef DEBUG
  freopen(argv[1], "r", stdin);
#endif

  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(15);

  int N;
  cin >> N;
  vector<int> D(N);
  rep(i, 0, N) cin >> D[i];
  vector<int> sums = {0};
  partial_sum(all(D), back_inserter(sums));
  int Q;
  cin >> Q;
  ll yi, mi, di, ki;
  ll y, m, d, n, x;
  while (Q--) {
    cin >> yi >> mi >> di >> ki;
    n = sums[mi - 1] + di + ki;
    y = n / sums[N] + yi;
    x = n % sums[N];
    auto p = lower_bound(all(sums), x);
    m = p - sums.begin();
    d = x - sums[m - 1];
    cout << y << ' ' << m << ' ' << d << endl;
  }
  return 0;
}