#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

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

ll e(){
    return -1LL;
}

ll mapping(ll f, ll x){
    if (f == -1LL){
        return x;
    }
    return f;
}

ll composition(ll f, ll g){
    if (f == -1LL){
        return g;
    }
    return f;
}

ll id(){
    return -1LL;
}

int main() {
    ll N, A;
    cin >> N >> A;
    vector<ll> X(N);
    for (ll i = 0; i < N; i++){
        cin >> X[i];
    }
    ll T;
    cin >> T;
    vector<ll> L(T);
    vector<ll> R(T);
    for (ll i = 0; i < T; i++){
        cin >> L[i] >> R[i];
    }
    map<ll, ll> mp;
    for (ll i = 0; i < N; i++){
        mp[X[i]]++;
    }
    for (ll i = 0; i < T; i++){
        mp[L[i]]++;
        mp[R[i]]++;
    }
    ll now = 1;
    for (auto itr = mp.begin(); itr != mp.end(); itr++){
        itr->second = now;
        now++;
    }
    lazy_segtree<ll, op, e, ll, mapping, composition, id> seg(now);
    for (ll i = 0; i < T; i++){
        seg.apply(mp[L[i]], mp[R[i]] + 1, i + 1);
    }
    for (ll i = 0; i < N; i++){
        cout << seg.get(mp[X[i]]) << endl;
    }
}