#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
const int Mod = 998244353;
inline void uadd(int &a, int b){ a += b-Mod; a += (a>>31) & Mod; }
inline void usub(int &a, int b){ a -= b, a += (a>>31) & Mod; }
inline void umul(int &a, int b){ a = (int)(1ll * a * b % Mod); }
inline int add(int a, int b){ a += b-Mod; a += (a>>31) & Mod; return a; }
inline int sub(int a, int b){ a -= b, a += (a>>31) & Mod; return a; }
inline int mul(int a, int b){ return (int)(1ll * a * b % Mod); }

int read(){
	int x = 0, c = getchar();
	while(c < '0' || c > '9') c = getchar();
	while(c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
	return x;
}
void putint(ll x){
	if(x < 0) putchar('-'), x = -x;
	static int cur[22], p; static ll nx;
	do{ nx = x / 10, cur[p++] = (int)(x - 10 * nx), x = nx; } while(x);
	while(p) putchar('0' + cur[--p]);
}

int n, m, c[1000100], a[1000100], d[1000100];
ll dis[1000100], ans[1000100];

int ord[1000100];

int main(){
	//ios::sync_with_stdio(false);
	//cin.tie(0);
	
	n = read(), m = read();
	rep(i, n) c[i] = read();
	rep(i, m) a[i] = read() - 1, d[i] = read(), dis[a[i]] += d[i];
	for(int i = n-2; i >= 0; --i) dis[i] += dis[i+1];

	rep(i, n) ord[i] = i;
	sort(ord, ord+n, [&](int lh, int rh){ return c[lh] < c[rh]; });

	int mnid = n;
	ll sum = 0;
	rep(i, n){
		int u = ord[i];
		mnid = min(mnid, u), sum += c[u];
		ans[i+1] = sum - dis[mnid];
		//cout << i+1 << " " << u << ": " << sum << " " << mnid << "\n";
	}

	mnid = ord[n-1];
	for(int i = n-1; i >= 0; --i){
		int u = ord[i];
		sum -= c[u];
		if(c[u] - dis[u] < c[mnid] - dis[mnid])
			mnid = u;
		//cout << i+1 << "  " << mnid << ": " << sum << " + " << c[mnid] << " - " << dis[mnid] << "\n";
		ans[i+1] = min(ans[i+1], sum + c[mnid] - dis[mnid]);
	}
	
	for(int i = 1; i <= n; ++i) putint(ans[i]), putchar(' ');
	putchar('\n');

	return 0;
}