/*
* Author: Nonoze
* Created: Tuesday 02/07/2024
*/
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
#define int long long
#ifdef _IN_LOCAL
#include <bits/DebugTemplate.h>
#else
#define dbg(...)
#endif
#define sz(x) (int)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define endl '\n'
#define endlfl '\n' << flush
template<typename T> void read(T& x, bool write=0) { if (write) cout << x << ' '; else cin >> x; }
template<typename T1, typename T2> void read(pair<T1, T2>& p, bool write=0) { read(p.first, write), read(p.second, write); if (write) cout << endl;}
template<typename T> void read(vector<T>& v, bool write=0) { for (auto& x : v) read(x, write); if (write) cout << endl; }
template<typename T1, typename T2> void read(T1& x, T2& y, bool write=0) { read(x, write), read(y, write); if (write) cout << endl; }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z, bool write=0) { read(x, write), read(y, write), read(z, write); if (write) cout << endl; }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz, bool write=0) { read(x, write), read(y, write), read(z, write), read(zz, write); if (write) cout << endl; }
template<typename T> void print(T x) { read(x, 1); }
template<typename T1, typename T2> void print(T1 x, T2 y) { read(x, y, 1); }
template<typename T1, typename T2, typename T3> void print(T1 x, T2 y, T3 z) { read(x, y, z, 1); }
template<typename T1, typename T2, typename T3, typename T4> void print(T1 x, T2 y, T3 z, T4 zz) { read(x, y, z, zz, 1); }
#define quit(x) return (void)(cout << x << endl)
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)
const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=25;
void solve();
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int tt=1;
// cin >> tt;
while(tt--) solve();
return 0;
}
int n, k, m, q;
vector<pair<int, int>> a;
void solve() {
read(n, q);
a.clear(), a.resize(n); read(a);
sort(all(a), [&](pair<int, int> x, pair<int, int> y) {
return (x.fi==y.fi ? x.se<y.se : x.fi>y.fi);
});
vector<pair<pair<int, int>, int>> queries;
for (int i = 0; i < q; i++) {
int l, r; read(l, r);
queries.pb({{l, r}, i});
}
sort(rall(queries));
int empl=0;
vector<int> LIS, ans(q);
for (int i=0; i<n; i++) {
while (empl<q && queries[empl].fi.fi>a[i].fi) {
auto lb=upper_bound(all(LIS), queries[empl].fi.se);
ans[queries[empl].se]=(lb-LIS.begin());
empl++;
}
auto lb=upper_bound(all(LIS), a[i].se);
if (lb==LIS.end()) LIS.pb(a[i].se);
else *lb=a[i].se;
}
while (empl<q) {
auto lb=upper_bound(all(LIS), queries[empl].fi.se);
ans[queries[empl].se]=(lb-LIS.begin());
empl++;
}
for (auto u: ans) cout << u << endl;
}
