#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}



void solve();
// POP'N ROLL MUSIC / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N;
    cin >> N;
    vector<ll> S(N);
    rep(i, 0, N) cin >> S[i];
    int Q;
    cin >> Q;
    vector<ll> X;
    ll L = 0, R = 0;
    while (Q--){
        ll T, F;
        cin >> T >> F;
        if (R < T) X.push_back(R - L), L = T, R = T;
        R += F;
    }
    X.push_back(R - L);
    So(X);
    vector<ll> ans(N);
    vector<int> order(N);
    rep(i, 0, N) order[i] = i;
    sort(all(order), [&](int l, int r){
        return S[l] < S[r];
    });
    ll val = vec_sum(X);
    vector<pair<ll, ll>> dec;
    const int Z = 100'000;
    vector<ll> save(Z);
    for (int l = 0, r = 0; l < X.size(); l = r){
        while (r != (int)X.size() && X[l] == X[r]) r++;
        {
            ll a = 1;
            while (a <= X[l]){
                ll v = X[l] / a;
                // X[l] / nx < v
                // X[l] / v < nx
                ll nx = X[l] / v + 1;
                if (nx < Z) save[nx] += (v - X[l] / nx) * (r - l);
                else dec.push_back({nx, (v - X[l] / nx) * (r - l)});
                a = nx;
            }
        }
    }
    Sore(dec);
    for (int i = Z - 1; i >= 0; i--) if (save[i]) dec.push_back({i, save[i]});
    for (auto id : order){
        while (!dec.empty() && S[id] >= dec.back().first){
            val -= dec.back().second;
            dec.pop_back();
        }
        ans[id] = val;
    }
    for (auto x : ans) cout << x << "\n";
}