#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5+10;
int n,m,a[N],b[N];
int ans,vis[N]; 
int st[N],top;
vector<int> o[N];

void solve(){
    ans = 0;
    for(int i=1;i<=n;i++)o[i].clear(),vis[i] = 0;
    for(int i=1;i<=n;i++)o[a[i]].push_back(i);
    for(int i=1;i<=n;i++){
        top = 0;
        for(auto u : o[i]){
            if(!a[u])st[++top] = u;
            else if(top)ans++,vis[u] = vis[st[top--]] = 1;
        }
    }
    top = 0;
    for(int i=1;i<=n;i++)if(!vis[i]){
        if(!b[i])top++; else if(top)ans++,top--;
    }
    cout<<ans<<"\n";
}
int main(){
    ios::sync_with_stdio(false); cin.tie(0);

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

    return 0;
}