#include <bits/stdc++.h>
using namespace std;
typedef long long i64;
const int maxn = 1000000;
struct item {
	int v; i64 sub;
	bool operator<(const item& b) const {
		if (v == b.v) return sub > b.sub;
		return v < b.v;
	}
} x[maxn + 5];
i64 smn[maxn + 5];
int main() {
	int n, m;
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++) scanf("%d", &x[i].v);
	for (int i = 1; i <= m; i++) {
		int a, d;
		scanf("%d%d", &a, &d);
		x[a].sub += d;
	}
	for (int i = n; i; i--) x[i].sub += x[i + 1].sub;
	sort(x + 1, x + n + 1);
	smn[n + 1] = 1E18; 
	for (int i = n; i; i--) smn[i] = min(smn[i + 1], x[i].v - x[i].sub);
	i64 pmx = 0, s = 0;
	for (int i = 1; i <= n; i++) {
		i64 ans = s + smn[i];
		s += x[i].v;
		ans = min(ans, s - pmx);
		pmx = max(pmx, x[i].sub);
		printf("%lld ", ans);
	}
}