#include <iostream>
#include <vector>
#include <set>
#include <algorithm>

using namespace std;
typedef long long ll;
ll a[200010],b[200010],t[200010],c[200010];
int main(){
    int i,n,m; cin >> n >> m;
    vector<pair<ll,ll>> v;
    for(i=0;i<n;i++) cin >> a[i];
    for(i=0;i<n;i++) cin >> b[i];
    for(i=0;i<n;i++){
        v.push_back({a[i],b[i]});
    }
    sort(v.begin(),v.end());
    multiset<ll> ms0,ms1;
    for(i=0;i<m;i++){
        cin >> t[i] >> c[i];
        if(t[i]==0) ms0.insert(c[i]);
        else ms1.insert(c[i]);
    }
    int ans = 0,cnt = 0;
    for(i=n - 1;i>=0;i--){
        while(ms0.size() && v[i].first<=*ms0.rbegin()){
            cnt++;
            ms0.erase(ms0.find(*ms0.rbegin()));
        }
        auto it = ms1.lower_bound(v[i].second);
        if(it!=ms1.end()){
            ans++;
            ms1.erase(it);
        }else if(cnt){
            ans++;
            cnt--;
        }
    }
    cout << n - ans << "\n";
}