#include <bits/stdc++.h>

using namespace std;

int a[1000010];
int t[1000010], lz[1000010];
int lzmx[1000010];
int st;

void build(int v, int tl, int tr) {
    if(tl == tr) {
        t[v] = a[v - st + 1];
        return;
    }
    int tm = (tl + tr) / 2;
    build(v * 2, tl, tm);
    build(v * 2 + 1, tm + 1, tr);
    t[v] = max(t[v * 2], t[v * 2 + 1]);
}

void spush(int v) {
    lz[v * 2] += lz[v];
    lz[v * 2 + 1] += lz[v];
    t[v * 2] += lz[v];
    t[v * 2 + 1] += lz[v];
    lzmx[v * 2] += lz[v];
    lzmx[v * 2 + 1] += lz[v];
    lzmx[v * 2] = max(lzmx[v * 2], lzmx[v]);
    lzmx[v * 2 + 1] = max(lzmx[v * 2 + 1], lzmx[v]);
    t[v * 2] = max(t[v * 2], lzmx[v * 2]);
    t[v * 2 + 1] = max(t[v * 2 + 1], lzmx[v * 2 + 1]);
    lz[v] = 0;
}

void md(int v, int tl, int tr, int l, int r, int x) {
    if(tl > r | tr < l)
        return;
    if(tl >= l && tr <= r) {
        lzmx[v] = max(lzmx[v], x);
        t[v] = max(t[v], x);
        return;
    }
    spush(v);
    int tm = (tl + tr) / 2;
    md(v * 2, tl, tm, l, r, x);
    md(v * 2 + 1, tm + 1, tr, l, r, x);
    t[v] = max(t[v * 2], t[v * 2 + 1]);
}

void add(int v, int tl, int tr, int l, int r) {
    if(tl > r || tr < l)
        return;
    if(tl >= l && tr <= r) {
        t[v]++;
        lz[v]++;
        lzmx[v]++;
        return;
    }
    spush(v);
    int tm = (tl + tr) / 2;
    add(v * 2, tl, tm, l, r);
    add(v * 2 + 1, tm + 1, tr, l, r);
    t[v] = max(t[v * 2], t[v * 2 + 1]);
}

int get(int v, int tl, int tr, int l, int r) {
    if(tl > r || tr < l)
        return 0;
    if(tl >= l && tr <= r) {
        return t[v];
    }
    spush(v);
    int tm = (tl + tr) / 2;
    int res = max(get(v * 2, tl, tm, l, r), get(v * 2 + 1, tm + 1, tr, l, r));
    t[v] = max(t[v * 2], t[v * 2 + 1]);
    return res;
}

void pushall(int v, int tl, int tr) {
    if(tl == tr)
        return;
    spush(v);
    int tm = (tl + tr) / 2;
    pushall(v * 2, tl, tm);
    pushall(v * 2 + 1, tm + 1, tr);
}

int32_t main() {
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    st = 1;
    while(st < n)
        st *= 2;
    build(1, 1, st);
    for(int i = 1; i <= m; i++) {
        int l, r;
        cin >> l >> r;
        int mx = get(1, 1, st, l, r);
        add(1, 1, st, l, r);
        md(1, 1, st, l, r, mx);
    }
    for(int i = 1; i <= n; i++)
        cout << t[i + st - 1] << " ";
    return 0;
}