// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")


#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T> using VVVV = VV<VV<T>>;
#define rep(i,n) for(ll i=0ll;(i)<(n);(i)++)
#define REP(i,a,n) for(ll i=(a);(i)<(n);(i)++)
#define rrep(i,n) for(ll i=(n)-1;(i)>=(0ll);(i)--)
#define RREP(i,a,n) for(ll i=(n)-1;(i)>=(a);(i)--)
const long long INF = (1LL << 60);
const long long mod99 = 998244353;
const long long mod107 = 1000000007;
const long long mod = mod99;
#define eb emplace_back
#define be(v) (v).begin(),(v).end()
#define all(v) (v).begin(),(v).end()
#define foa(i,v) for(auto& (i) : (v))
#define UQ(v) sort(be(v)), (v).erase(unique(be(v)), (v).end())
#define UQ2(v,cmp) sort(be(v)), (v).erase(unique(be(v),cmp), (v).end())
#define UQ3(v,cmp) sort(be(v),cmp), (v).erase(unique(be(v)), (v).end())
#define UQ4(v,cmp,cmp2) sort(be(v), cmp), (v).erase(unique(be(v),cmp2), (v).end())
#define LB(x,v) (lower_bound(be(v),(x))-(v).begin())
#define LB2(x,v,cmp) (lower_bound(be(v),(x),(cmp))-(v).begin())
#define UB(x,v) (upper_bound(be(v),(x))-(v).begin())
#define UB2(x,v,cmp) (upper_bound(be(v),(x),(cmp))-(v).begin())
#define dout()  cout << fixed << setprecision(20)
#define randinit() srand((unsigned)time(NULL))

template<class T, class U> bool chmin(T& t, const U& u) { if (t > u){ t = u; return 1;} return 0; }
template<class T, class U> bool chmax(T& t, const U& u) { if (t < u){ t = u; return 1;} return 0; }


ll Rnd(ll L=0, ll R=mod99){return rand()%(R-L)+L;}


template <typename T>
struct BIT { 
    vector<T> seg;
    int _n;//葉の数
    
    BIT(int N) : seg(N+2, 0), _n(N+2) {}
    BIT(const vector<T> a) : seg(a.size()+2, 0), _n(a.size()+2) {
        int N = a.size();
        for(int i=0; i<N; i++) seg[i+1] = a[i];
        for(int i=1; i<=N; i++) if(i+(i&-i) <= N) seg[i + (i&-i)] += seg[i];
    }

    void apply(int idx, T x){
        if(idx < 0) return;
        idx++;
        for(;idx <= _n; idx+=(idx&-idx)) seg[idx] += x; 
    }
    T prod(int x){
        if(x <= 0) return 0;
        T ret = 0;
        for(;x; x-=(x&-x)) ret += seg[x];
        return ret;
    }
    T prod(int a, int b) { return prod(b) - prod(a);}
};


void solve(){
    ll n;
    cin >> n;
    V<ll> s(n);
    rep(i,n) cin >> s[i];
    
    V<ll> ss = s;
    UQ(ss);
    BIT<ll> bit(ss.size()+1);
    
    ll q;
    cin >> q;
    ll l = 0, r = 0;
    map<ll,ll> mp;
    rep(i, q){
        ll a,b;
        cin >> a >> b;
        if(a > r){
            if(r!=l){
                mp[r-l]++;
            }
            l=a;
            r=a;
        }
        r += b;
    }
    mp[r-l] ++;
    V<ll> ans(100100, 0);
    
    for(auto [t,x]:mp){
        ll m = sqrt(x+10);
        chmin(m, t);
        for(ll i=1; i<=m; i++){
            ans[i] += t/i*x;
        }
        for(ll i=m; i>=1; i--){
            ll l, r;
            l = max(m+1, (t+i)/(i+1));
            r = t/i+1;
            if(l >= r) continue;
            // cout << t << " " << i << " " << l << " " << r << endl;
            bit.apply(LB(l, ss), i*x);
            bit.apply(LB(r, ss), -i*x);
        }
    }
    for(auto x:s){
        ll ret = 0;
        if(x < 100100) ret += ans[x];
        ret += bit.prod(UB(x, ss));
        cout << ret << '\n';
    }
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t=1;
    // cin >> t;
    rep(i,t) solve();
}