#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}



void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,0,t) solve();
}

void solve(){
	ll N,M;
	cin>>N>>M;
	vector<pair<ll,ll>> A(N);
	rep(i,0,N) cin>>A[i].first;
	rep(i,0,N) cin>>A[i].second;
	vector<vector<ll>> p(2);
	rep(i,0,M){
		ll a,b;
		cin>>a>>b;
		p[a].push_back(b);
	}
	So(p[0]),So(p[1]);
	So(A);
	priority_queue<pair<ll,int>> pq;
	vector<int> use(N);
	int ind=0;
	for(auto x:p[0]){
		while(ind!=N&&x>=A[ind].first){
			pq.push({A[ind].second,ind});
			ind++;
		}
		if(!pq.empty()){
			auto tmp=pq.top();
			pq.pop();
			use[tmp.second]=1;
		}
	}
	while(!pq.empty()) pq.pop();
	rep(i,0,N){
		if(use[i]==0) pq.push({A[i].second,i});
	}
	reverse(all(p[1]));
	for(auto x:p[1]){
		while(!pq.empty()&&pq.top().second>x) pq.pop();
		if(!pq.empty()) use[pq.top().second]=1,pq.pop();
	}
	cout<<N-vec_sum(use)<<"\n";
}