#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main () {
	int N;
	cin >> N;
	std::vector<ll> S(N);
	for (ll& a : S) cin >> a;
	vector<int> ID(N);
	iota(ID.begin(), ID.end(), 0);
	{
		auto IDD = ID;
		sort(IDD.begin(), IDD.end(), [&](int i, int j) {return S[i] < S[j];});
		for (int i = 0; i < N; i ++) {
			ID[IDD[i]] = i;
		}
	}
	sort(S.begin(), S.end());
	vector<ll> TL;
	int Q;
	cin >> Q;
	{
		ll b = 0, e = 0, n = 0;
		while (Q--) {
			ll t, f;
			cin >> t >> f;
			if (e >= t) {
				e += f;
			} else {
				if (e - b) TL.push_back(e - b);
				b = t; e = t + f;
			}
			n = t;
		}
	}
	vector<ll> ans(1000, 0);
	for (int i = 1; i < 1000; i ++) {
		for (auto& f : TL) {
			ans[i] += f / i;
		}
	}
	vector<ll> A2(N + 1, 0);
	for (auto& f : TL) {
		for (ll s = 1; s * 1000 <= f; s ++) {
			ll d = f / s;
			A2[0] ++;
			int i = upper_bound(S.begin(), S.end(), d) - S.begin();
			A2[i] --;
		}
	}
	for (int i = 1; i <= N; i ++) A2[i] += A2[i-1];
	for (int& a : ID) {
		if (S[a] < 1000) {
			cout << ans[S[a]] << endl;
		} else {
			cout << A2[a] << endl;
		}
	}
}