#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000086, MOD = 998244353;//, INF = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
int n, m, w[N];


struct Node {
    ll t, v;
}e[N];
ll v[N];
vector<ll> num;
int find(int x) { return lower_bound(num.begin(), num.end(), x) - num.begin(); }

struct ST {
    struct Node {
        int l, r;
        ll sum, flag;
    };
    vector<Node> tr;

    ST(ST&& other) noexcept : tr(move(other.tr)) { }
    ST (int l, int r) : tr(vector<Node>(((r - l) << 2) + 10)) { build(1, l, r); }

    ST& operator=(ST&& other) noexcept {
        if (this != &other) {
            tr = move(other.tr);
        }
        return *this;
    }

    void pushup(int u) { tr[u].sum = tr[u << 1].sum + tr[u << 1 | 1].sum; }
    void pushdown(Node& u, Node& l, Node& r) {
        l.flag += u.flag, r.flag += u.flag;
        l.sum += u.flag * (l.r - l.l + 1), r.sum += u.flag * (r.r - r.l + 1);
        u.flag = 0;
    }
    void pushdown(int u) { if (tr[u].flag) pushdown(tr[u], tr[u << 1], tr[u << 1 | 1]); }

    void build(int u, int l, int r) {
        tr[u] = {l, r};
        if (l == r) return;
        int mid = l + r >> 1;
        build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
        pushup(u);
    }

    ll query(int u, int l, int r) {
        if (tr[u].l >= l && tr[u].r <= r) return tr[u].sum;
        pushdown(u);
        int mid = tr[u].l + tr[u].r >> 1;
        ll res = 0;
        if (l <= mid) res += query(u << 1, l, r);
        if (r > mid) res += query(u << 1 | 1, l, r);
        return res;
    }

    void modify(int u, int l, int r, ll v) {
        if (tr[u].l >= l && tr[u].r <= r) tr[u].flag += v, tr[u].sum += (tr[u].r - tr[u].l + 1) * v;
        else {
            pushdown(u);
            int mid = tr[u].l + tr[u].r >> 1;
            if (l <= mid) modify(u << 1, l, r, v);
            if (r > mid) modify(u << 1 | 1, l, r, v);
            pushup(u);
        }
    }
};

int main() {
    cin >> n;
    for (int i = 1; i < n + 1; i++) scanf("%lld", v + i);
    cin >> m;
    for (int i = 1; i < m + 1; i++) scanf("%lld%lld", &e[i].t, &e[i].v);
    ll l = 0, r = 0;
    vector<ll> g;
    for (int i = 1; i < m + 1; i++) {
        if (!l) l = e[i].t, r = e[i].t + e[i].v;
        else {
            if (r >= e[i].t) r += e[i].v;
            else g.push_back(r - l), l = e[i].t, r = e[i].t + e[i].v;
        }
    }
    if (l) g.push_back(r - l);
    for (int i = 1; i < n + 1; i++) num.push_back(v[i]);
    sort(num.begin(), num.end());
    num.erase(unique(num.begin(), num.end()), num.end());

    ST tr(0, num.size());
    for (auto u : g) {
        ll l = 1;
        while (l <= u) {
            ll v = u / l, r = u / v;
            int pl = find(l), pr = find(r + 1);
            // printf("%lld %lld %d %d\n", l, r, pl, pr);
            if (pl < pr) tr.modify(1, pl, pr - 1, v);
            l = r + 1;
        }
    }
    for (int i = 1; i < n + 1; i++) printf("%lld\n", tr.query(1, find(v[i]), find(v[i])));
    return 0;
}