#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;
}
using ull=unsigned long long;
int main(){
//入力
cin.tie(0);
ios::sync_with_stdio(0);
ll n,s;
cin>>n>>s;
vector<ll> a(n);
for(ll i=0;i<n;i++){
cin>>a[i];
}
sort(a.begin(),a.end(),greater<ll>());
// 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[j]=a[j]-c;
}
vector<ll> v(n);
ll l=0,r=b;
for(ll j=0;j<n;j++){
if(l==b){
v[j]=a[r];
r++;
}
else if(r==n){
v[j]=a[l];
l++;
}
else{
if(a[l]>=a[r]){
v[j]=a[l];
l++;
}else{
v[j]=a[r];
r++;
}
}
}
a=v;
}
for(ll i=0;i<n;i++){
cout<<a[i]<<" ";
}
cout<<endl;
return 0;
}
