#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
int main(){
    ll n,m;cin >> n >> m;
    vpl v(n);
    rep(i,n)cin >> v[i].first;
    rep(i,n)cin >> v[i].second;
    vl x,y;
    rep(i,m){
        ll t,c;cin >> t >> c;
        if(t==0)x.emplace_back(c);
        else y.emplace_back(c);
    }
    priority_queue<ll> que;
    ll now=0;
    sort(all(x));sort(all(y));sort(all(v));
    rep(i,x.size()){
        while(now<n&&v[now].first<=x[i]){
            que.push(v[now].second);
            now++;
        }
        if(que.size())que.pop();
    }
    vl rem;
    while(now<n){
        rem.emplace_back(v[now].second);now++;
    }
    while(que.size()){
        rem.emplace_back(que.top());que.pop();
    }
    sort(all(rem));
    //for(auto p:rem)cout << p << endl;
    now=0;
    ll cnt=0;
    rep(i,y.size()){
        while(now<rem.size()&&rem[now]<=y[i]){
            cnt++;now++;
        }
        if(cnt)cnt--;
    }
    while(now<rem.size()){
        now++;cnt++;
    }
    cout << cnt << endl;
}