#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;

#define pass (void)0
#define INF (1<<30)-1
#define INFLL (1LL<<60)-1
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define repr2(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define YesNo(cond) cout << ((cond) ? "Yes\n" : "No\n")
#define YESNO(cond) cout << ((cond) ? "YES\n" : "NO\n")

using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;

template <typename T> void print(const T& value) { cout << value << "\n"; }
template <typename T> void print(const vector<T>& vec) { for (auto& v : vec) cout << v << " "; cout << "\n"; }
template <typename T> void input(vector<T>& vec) { for (auto& v : vec) cin >> v; };
template <typename T> bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }
template <typename T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }

#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using vm = vector<mint>;

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

    const ll shikii = 10000000LL;

    ll N; cin >> N;
    vl S(N);
    input(S);
    ll Q; cin >> Q;
    vl A;
    ll time = 0;
    ll cnt = 0;
    while (Q--) {
        ll T, F; cin >> T >> F;
        if (time < T) {
            if (cnt) A.push_back(cnt);
            cnt = F;
            time = T+F;
        } else {
            cnt += F;
            time += F;
        }
    }
    if (cnt) A.push_back(cnt);

    vl ans(N, 0);
    vl cum(shikii, 0);
    for (auto a : A) {
        if (shikii <= a) {
            rep (i, N) {
                ans[i] += a/S[i];
            }
        } else {
            cum[a] ++;
        }
    }
    rep2 (i, 1, shikii) cum[i] += cum[i-1];

    vl ansS(shikii, 0);
    rep2 (i, 1, shikii) {
        rep2 (j, 1, INF) {
            ll l = i*j;
            if (shikii <= l) break;
            ll r = min((ll)(l+i-1), shikii-1);
            ansS[i] += (cum[r]-cum[l-1])*j;
        }
    }
    rep (i, N) {
        if (S[i] < shikii) {
            ans[i] += ansS[S[i]];
        }
    }

    for (auto a : ans) {
        print(a);
    }
}