#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;

#define all(x) (x).begin(),(x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define endl "\n"

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {os << "["; for (const auto &v : vec) {os << v << ","; } os << "]"; return os;}
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p) {os << "(" << p.first << ", " << p.second << ")"; return os;}
ll mod_pow(ll a, ll n, ll mod) { ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }

const int mod = 1e9 + 7;

void solve() {
    int N, M; cin >> N >> M;
    vector<int> A(N), B(N);
    for (int i = 0; i < N; i++) {
        cin >> A[i];
    }
    for (int i = 0; i < N; i++) {
        cin >> B[i];
    }
    vector<pii> X;
    for (int i = 0; i < M; i++) {
        int t, c; cin >> t >> c;
        X.push_back({c, t});
    }
    sort(all(X));    
    reverse(all(X));
    
    multiset<pii> S1, S2;
    vector<int> deleted(N);
    for (int i = 0; i < N; i++) {
        S1.insert({A[i], i});
    }
    for (int i = 0; i < N; i++) {
        S2.insert({B[i], i});
    }

    auto f = [](pii a, pii b) {
        return a < b;
    };

    for (int i = 0; i < M; i++) {
        pii x = X[i];
        int t = x.second, c = x.first;
        if (t == 0) {
            auto it = S1.upper_bound({c, 1e9});
            it--;
            while(it != S1.begin() && deleted[(*it).second]) {
                //it = S1.erase(it);
                it--;
            }
            if (it != S1.end()) deleted[(*it).second] = 1;
            //S1.erase(it);
        } else {
            auto it = S2.upper_bound({c, 1e9});
            it--;
            while(it != S2.begin() && deleted[(*it).second]) {
                //it = S2.erase(it);
                it--;
            }
            if (it != S2.end()) deleted[(*it).second] = 1;
            //S2.erase(it);
        }
        cerr << "--------" << endl;
        cerr << deleted << endl;
        for (auto x1 : S1) {
            cerr << x1 << endl;
        }
        cerr << "aaa" << endl;
        for (auto x2 : S2) {
            cerr << x2 << endl;
        }
    }
    cout << S1.size() << endl;
}



int main() {
    #ifdef LOCAL_ENV
    cin.exceptions(ios::failbit);
    #endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout.setf(ios::fixed);
    cout.precision(16);
    
    solve();
}