#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ff first
#define ss second
#define pii pair<int, int>
#define all(v) (v).begin(), (v).end()
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
int n, m;
cin >> n >> m;
pii p[n];
for (int i = 0; i < n; i++)
cin >> p[i].ss >> p[i].ff;
sort(p, p + n);
vector<int> c(m);
for (auto &i : c)
cin >> i;
sort(all(c));
vector<int> dp(m, m);
for (int i = 0; i < n; i++) {
for (int j = m - 1; j >= 0; j--)
if (dp[j - 1] + 1 < m) dp[j] = min(dp[j], int(lower_bound((j ? dp[j - 1] : -1) + 1 + all(c), p[i].ss) - c.begin()));
}
for (int i = m - 1; i >= -1; i--)
if (!~i || dp[i] != m) return cout << i + 1, 0;
}
