#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 N,Q;
long S[500000];
long ans[500000+1];
vector<long> A;
pair<long,int> B[500000];

const long L=2000000+1;
vector<pair<long,long>> C[L];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    cin>>N;
    rep(i,N)cin>>S[i];
    cin>>Q;
    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;
        }
    }
    rep(i,N) B[i]=make_pair(S[i], i);
    sort(B,B+N);

    for(long t: A){
        for(auto [l,r,x]: f(t)){
            C[min(L,l)].push_back({l,x});
            C[min(L,r)].push_back({r,-x});
        }
    }
    sort(all(C[L]));
    {
        long cur=0;
        int id=0;
        rep(j,L+1){
            for(auto [i, x]: C[j]){
                while(id<N&&B[id].fi<i) ans[B[id].se]+=cur, id++;
                cur+=x;
            }
        }
    }

    rep(i,N)cout<<ans[i]<<"\n";
}