#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector<int>a(n), b(n);
	rep(i, n)cin >> a[i];
	rep(i, n)cin >> b[i];
	vector<P>p(n);
	rep(i, n)p[i] = { a[i],b[i] };
	vector<int>t(m), c(m);
	vector<int>zero, one;
	rep(i, m) {
		cin >> t[i] >> c[i];
		if (0 == t[i])zero.push_back(c[i]);
		else one.push_back(c[i]);
	}
	sort(all(zero));
	sort(all(one));
	priority_queue<P, vector<P>, greater<P>> pq;
	priority_queue<int>pq1;
	priority_queue<int, vector<int>, greater<int>> pq2;
	rep(i, n)pq.push(p[i]);
	rep(i, zero.size()) {
		while (!pq.empty()) {
			auto[x, y] = pq.top();
			if (x <= zero[i]) {
				pq1.push(y);
				pq.pop();
			}
			else break;
		}
		if (!pq1.empty()) {
			pq1.pop();
		}
	}
	while (!pq1.empty()) {
		pq2.push(pq1.top());
		pq1.pop();
	}
	while (!pq.empty()) {
		auto[x, y] = pq.top();
		pq2.push(y);
		pq.pop();
	}
	rep(i, one.size()) {
		if (!pq2.empty()) {
			if (pq2.top() <= one[i]) {
				pq2.pop();
			}
		}
	}
	cout << pq2.size() << endl;
	return 0;
}