#pragma GCC optimize("O2") #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define int ll #define INT128_MAX (__int128)(((unsigned __int128) 1 << ((sizeof(__int128) * __CHAR_BIT__) - 1)) - 1) #define INT128_MIN (-INT128_MAX - 1) #define clock chrono::steady_clock::now().time_since_epoch().count() #ifdef DEBUG #define dbg(x) cout << (#x) << " = " << x << '\n' #else #define dbg(x) #endif namespace R = std::ranges; namespace V = std::views; using namespace std; using ll = long long; using ull = unsigned long long; using ldb = long double; using pii = pair; using pll = pair; //#define double ldb template ostream& operator<<(ostream& os, const pair pr) { return os << pr.first << ' ' << pr.second; } template ostream& operator<<(ostream& os, const array &arr) { for(const T &X : arr) os << X << ' '; return os; } template ostream& operator<<(ostream& os, const vector &vec) { for(const T &X : vec) os << X << ' '; return os; } template ostream& operator<<(ostream& os, const set &s) { for(const T &x : s) os << x << ' '; return os; } signed main() { ios::sync_with_stdio(false), cin.tie(NULL); int n, a; cin >> n >> a; multiset m; for(int i = 0; i < n; i++) { int x; cin >> x; m.insert(pii(x, i)); } int t; cin >> t; vector> query(t); for(auto &[l, r] : query) cin >> l >> r; vector ans(n, -1); for(int i = n; auto [l, r] : query | V::reverse) { while(m.lower_bound(pii(l, -1)) != m.end() and m.lower_bound(pii(l, -1)) -> first <= r) { ans[m.lower_bound(pii(l, -1)) -> second] = i; m.erase(m.lower_bound(pii(l, -1))); } i--; } for(int x : ans) cout << x << '\n'; return 0; }