#include<bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
//using namespace atcoder;
#define rep(i,n) for(ll i=0; i<n; i++)
#define rrep(i,n) for(ll i=n-1; i>=0; i--)
#define print(a) cout<<a<<endl
typedef long long ll;
#define yn(flg) if(flg){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
#define YN(flg) if(flg){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define so(a) sort(a.begin(),a.end())
#define mp make_pair
#define vi vector<int>
#define vl vector<ll>
#define vs vector<string>
#define pb push_back
#define a2i(a,s) (ll)(a-s)
#define i2a(s,a) (char)(s+a)
#define ssize(a) a.size()
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<pair<ll,ll>,ll> P3;
typedef pair<pair<ll,ll>,pair<ll,ll>> P4;
typedef pair<ll, ll> Pll;
typedef pair<ll,Pll> Plll;
typedef pair<Pii, int> Piii;
const ll INF = 1000000000000000000;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define INFTY 1000000001
using ull=unsigned long long;
void merge(int A[], int left, int mid, int right) {
int i, j, k;
int n1, n2; // 部分列L, Rの要素数決定に利用
n1 = mid - left;
n2 = right - mid;
int L[n1+1], R[n2+1];
for (i = 0; i < n1; i++) L[i] = A[left + i];
for (i = 0; i < n2; i++) R[i] = A[mid + i];
L[n1] = INFTY;
R[n2] = INFTY;
// sort
j = 0;
k = 0;
for (i = left; i < right; i++) {
if (L[j] <= R[k]) {
A[i] = L[j];
j++;
} else {
A[i] = R[k];
k++;
}
}
}
void merge_sort(int A[], int left, int right) {
if (left + 1 < right) {
int mid;
mid = (left + right) / 2;
// devide
merge_sort(A, left, mid);
merge_sort(A, mid, right);
// conquer
merge(A, left, mid, right);
}
}
int main(){
//入力
cin.tie(0);
ios::sync_with_stdio(0);
ll n,s;
cin>>n>>s;
int a[200000];
for(ll i=0;i<n;i++){
cin>>a[i];
}
merge_sort(a,0,n);
// for(ll i=0;i<n;i++){
// cout<<a[i]<<" ";
// }
// cout<<endl;
//判定
rep(i,s){
ll c,b;
cin>>c>>b;
rep(j,b){
a[n-j-1]=a[n-j-1]-c;
}
merge_sort(a,0,n);
}
for(ll i=n-1;i>=0;i--){
cout<<a[i]<<" ";
}
cout<<endl;
return 0;
}
