#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
//#define int ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;

#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;

#ifdef RUS_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif

const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";


template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1>
inline istream & operator >> (istream &in, pair<T0, T1> &a) {
    return in >> a.first >> a.second;
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}


void smain();



signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
#ifdef RUS_HOME
    freopen("input", "r", stdin);
    clock_t start = clock();
#endif
    cout << setprecision(12) << fixed;
    smain();
#ifdef RUS_HOME
    cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
    return 0;
}

// const int N=2e5+100;

// int t[4*N],pushing[4*N];


// void push(int v,int tl,int tr) {
//     if (!pushing[v])
//         return;
//     pushing[v << 1] = pushing[v];
//     pushing[v << 1 | 1] = pushing[v];
//     int tm=tl+tr>>1;
//     if(pushing[v]==1){
//         t[v << 1] =(tm-tl+1);
//         t[v << 1 | 1] =(tr-tm+1+1);
//     }else{
//         t[v << 1] = 0;
//         t[v << 1 | 1] = 0;
//     }
//     pushing[v] = 0;
// }

// void upd(int v, int tl, int tr, int l, int r, int val) {
//     if (l > r)
//         return;
//     if (tl == l && r == tr) {
//         if(val==1)
//             t[v] = r-l+1;
//         else
//             t[v] = 0;
//         pushing[v] = val;
//         return;
//     }
//     push(v, tl, tr);
//     int tm = tl + tr >> 1;
//     upd(v << 1, tl, tm, l, min(tm, r), val);
//     upd(v << 1 | 1, tm + 1, tr, max(tm + 1, l), r, val);
//     t[v] = t[v << 1]+t[v << 1 | 1];
// }


void smain() {

    int n,m;
    cin>>n>>m;
    vi a(n);
    map<int,int>mp;
    for(int i=0;i<n;i++){
        cin>>a[i];
        a[i]--;
        mp[a[i]]++;
    }

    vi kek(n+1),l(n),r(n);


    for(int i=0;i<n;i++){
        l[i]=i-mp[i]+1;
        r[i]=i;

        int ll=max(0,l[i]);
        int rr=r[i]+1;
        kek[ll]++;
        kek[rr]--;
    }
    int ans=(kek[0]==0);
    for(int i=1;i<n;i++){
        kek[i]+=kek[i-1];
        ans+=(kek[i]==0);
    }

    for(int i=0;i<m;i++){
        int x,y;
        cin>>x>>y;
        x--;y--;
        if(l[a[x]]>=0){
            kek[l[a[x]]]--;
            ans+=(kek[l[a[x]]]==0);
        }
        l[a[x]]++;

        a[x]=y;
        l[a[x]]--;
        if(l[a[x]]>=0){
            ans-=(kek[l[a[x]]]==0);
            kek[l[a[x]]]++;
        }

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



}

Measured memory_bytes: 14080