#include <bits/stdc++.h>

void solve() {
    int n, a;
    std::cin >> n >> a;
    std::map<int, std::vector<int>> pos;
    for (int i = 0; i < n; i++) {
        int x;
        std::cin >> x;
        pos[x].push_back(i);
    }
    std::vector<int> ans(n, -1);
    int t;
    std::cin >> t;
    std::vector<std::pair<int, int>> intervals;
    for (int i = 0; i < t; i++) {
        int l, r;
        std::cin >> l >> r;
        r++;
        intervals.emplace_back(l, r);
    }
    for (int i = t - 1; i >= 0; i--) {
        auto [l, r] = intervals[i];
        while (true) {
            auto it = pos.lower_bound(l);
            if (it == pos.end()) break;
            if (it->first >= r) break;
            for (auto j: it->second) {
                ans[j] = i;
            }
            pos.erase(it);
        }
    }
    for (int i = 0; i < n; i++) {
        std::cout << (ans[i] == -1 ? -1 : ans[i] + 1) << '\n';
    }
}

int main() {
    std::cin.tie(0)->sync_with_stdio(0);
    std::cout << std::fixed << std::setprecision(16);
    int t = 1;

    while (t--) solve();
}