//EGOI 2022 Data Centers
//https://qoj.ac/contest/2260/problem/5182
#include <bits/stdc++.h>
using namespace std;
using ll = int;
using vll = vector<ll>;
int main(){
cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit);
ll n, q, a, b;
cin >> n >> q;
vll A(n);
for(int i=0; i<n; i++) cin >> A[i];
auto mysort=[&](ll x){
ll l=0, r=x; vll B;
while(l<x || r<n){
if(l==x) B.push_back(A[r++]);
else if(r==n) B.push_back(A[l++]);
else if(A[l]>=A[r]) B.push_back(A[l++]);
else B.push_back(A[r++]);
}
A=B;
};
sort(A.rbegin(),A.rend());
for(int i=0; i<q; i++){
cin >> a >> b;
for(int j=0; j<b; j++) A[j]-=a;
mysort(b);
}
for(int i=0; i<n; i++) cout << A[i] << " ";
cout << "\n";
}
