#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 5;

int n, m, a[N], b[N], used[N];
vector <int> pos[N];

void solve(){
    int ans = 0;
    for (int i = 1; i <= n; ++ i) pos[i].clear(), pos[i].clear();
    for (int i = 1; i <= n; ++ i){
        pos[a[i]].push_back(i);
        used[i] = 0;
    }

    for (int v = 1; v <= n; v ++){
        vector <int> stk;
        for (int p : pos[v]){
            if (!b[p]) stk.push_back(p);
            else if (stk.size()){
                int q = stk.back(); stk.pop_back();
                ans ++;
                used[p] = 1, used[q] = 1;
            }
        }
    }

    vector <int> stk;
    for (int p = 1; p <= n; p ++) if (!used[p]){
        if (!b[p]) stk.push_back(p);
        else if (stk.size()){
            int q = stk.back(); stk.pop_back();
            ans ++;
            used[p] = 1, used[q] = 1;
        }
    }

    cout << ans << "\n";
}

void process(){
    cin >> n >> m;
    for (int i = 1; i <= n; ++ i) cin >> a[i];
    for (int i = 1; i <= n; ++ i) cin >> b[i];
    solve();
    while (m --){
        int i, p, q; cin >> i >> p >> q;
        a[i] = p, b[i] = q;
        solve();
    }
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    process();
    return 0;
}