#include <bits/stdc++.h>
using namespace std;
// #include<atcoder/all>
// using mint = atcoder::modint998244353;
using ld = long double;
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(int)(n);++i)
template<typename T>bool chmin(T&a,T b){return b<a?(a=b,1):0;}
template<typename T>bool chmax(T&a,T b){return b>a?(a=b,1):0;}

#pragma GCC optimize("O2")


vector<array<long,3>> f(long N){
    vector<array<long,3>> ret;
    for(long i=1;i<=N;){
        long q=N/i;
        long j=N/q;
        ret.push_back({i,j+1,q});
        i=j+1;
    }
    return ret;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int N;
    cin>>N;
    vector<long> S(N);
    rep(i,N)cin>>S[i];
    int Q;
    cin>>Q;
    vector<long> A;
    long end=0;
    rep(i,Q){
        long t,f;
        cin>>t>>f;
        if(end<t){
            A.push_back({f});
            end=t+f;
        }
        else{
            A.back()+=f;
            end+=f;
        }
    }
    vector<pair<long,int>> B(N);
    rep(i,N) B[i]=make_pair(S[i], i);
    sort(all(B));
    vector<long> sum(N+1,0);

    vector<vector<array<long,2>>> C(5000000);
    vector<array<long,2>> D;
    for(long t: A){
        vector<array<long,3>> X=f(t);
        for(auto [l,r,x]: X){
            if(l<5000000){
                C[l].push_back({l,x});
            }
            else{
                D.push_back({l,x});
            }
            if(r<5000000){
                C[r].push_back({r,-x});
            }
            else{
                D.push_back({r,-x});
            }
        }
    }
    sort(all(D));

    vector<array<long,2>> E;
    for(auto v: C)for(auto e: v)E.push_back(e);
    for(auto e: D)E.push_back(e);
    
    {
        long cur=0;
        int id=0;
        for(auto [i, x]: E){
            while(id<N&&B[id].fi<i) sum[id]+=cur, id++;
            cur+=x;
        }
    }

    vector<long> ans(N);
    rep(i,N) ans[B[i].se]=sum[i];
    rep(i,N)cout<<ans[i]<<"\n";
}