#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<vi> vvi;
typedef vector<vll> vvll;

template <class T> using Vec = vector<T>;
template <class T> using Graph = Vec<Vec<T>>;

#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _rrep(i,n) rrepi(i,n-1,-1)
#define rrepi(i,a,b) for(int i=int(a);i>int(b);--i)
#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep)(__VA_ARGS__)

#define all(x) (x).begin(),(x).end()
#define SORT(x) sort(all(x))
#define REVERSE(x) reverse(all(x))

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

int op(int a, int b) {
    return max(a, b);
}

int e() {
    return -1;
}

int mapping(int f, int x) {
    return max(f, x);
}

int composition(int f, int g) {
    return max(f, g);
}

int id() {
    return -1;
}

int main() {
    int N, A;
    cin >> N >> A;

    vi X(N);
    rep(i, N) cin >> X[i];

    int T;
    cin >> T;

    vi L(T), R(T);
    rep(i, T) cin >> L[i] >> R[i];

    vi S;
    for (auto x: X) S.emplace_back(x);
    for (auto l: L) S.emplace_back(l);
    for (auto r: R) S.emplace_back(r);
    unique(all(S));
    SORT(S);

    map<int, int> mp;
    rep(i, S.size()) mp[S[i]] = i;

    rep(i, N) X[i] = mp[X[i]];
    rep(i, T) L[i] = mp[L[i]];
    rep(i, T) R[i] = mp[R[i]];

    int M = S.size() + 1;
    lazy_segtree<int, op, e, int, mapping, composition, id> seg(M);

    rep(t, T) seg.apply(L[t], R[t]+1, t+1);
    for (auto x: X) cout << seg.get(x) << " ";
    cout << endl;

}