#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define int long long
#define all(v) v.begin(), v.end()
using namespace std;
const int mxn = 1e6 + 5, mod = 1e9 + 7, inf = 1e18;
void solve() {
int n, q;
cin >> n >> q;
vector<pair<int, int>> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i].ff >> v[i].ss;
}
sort(all(v)); reverse(all(v));
while (q--) {
int a, b;
cin >> a >> b;
multiset<pair<int, int>> st;
vector<pair<int, int>> m;
for (auto[l, r]: v) {
if (l >= a && r <= b) {
m.pb({l, r});
}
}
vector<int> f;
for (int i = 0; i < m.size(); i++) {
bool ok = false;
vector<pair<int, int>> f;
for (auto [l, r]: st) {
f.pb({l, r});
}
sort(all(f)); reverse(all(f));
for (auto[l, r]: f) {
if (m[i].ff < l && m[i].ss < r) {
st.erase(st.find({l, r}));
st.insert(m[i]);
ok = true;
break;
}
}
if (!ok) {
st.insert(m[i]);
}
}
cout << st.size() << '\n';
}
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(nullptr);
int t = 1;
// cin >> t;
for (int i = 1; i <= t; i++) {
solve();
}
}
