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

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
//#define ll __int128
//#define int ll
//#define int ll
//#define char 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 MAX_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 MAX_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
    cout << setprecision(12) << fixed;
    smain();
#ifdef MAX_HOME
    cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
    return 0;
}

const int N = 2e5 + 10;
struct Tree {
    vi tmin, cnt, pushing;

    void build(int v, int tl, int tr) {
        if (tl == tr) {
            tmin[v] = 0;
            cnt[v] = 1;
            return;
        }
        int tm = tl + tr >> 1;
        build(v << 1, tl, tm);
        build(v << 1 | 1, tm + 1, tr);
        tmin[v] = 0;
        cnt[v] = cnt[v << 1] + cnt[v << 1 | 1];
    }

    Tree(int n) {
        tmin.resize(n << 2, 0);
        cnt.resize(n << 2, 0);
        pushing.resize(n << 2, 0);
        build(1, 1, n);
    }


    void push(int v) {
        if (pushing[v]) {
            pushing[v << 1] += pushing[v];
            pushing[v << 1 | 1] += pushing[v];
            tmin[v << 1] += pushing[v];
            tmin[v << 1 | 1] += pushing[v];
            pushing[v] = 0;
        }
    }

    void upd(int v, int tl, int tr, int l, int r, int inc) {
        if (l > r)
            return;
        if (tl == l && tr == r) {
            tmin[v] += inc;
            pushing[v] += inc;
            return;
        }
        push(v);
        int tm = tl + tr >> 1;
        upd(v << 1, tl, tm, l, min(tm, r), inc);
        upd(v << 1 | 1, tm + 1, tr, max(tm + 1, l), r, inc);
        if (tmin[v << 1] == tmin[v << 1 | 1]) {
            tmin[v] = tmin[v << 1];
            cnt[v] = cnt[v << 1] + cnt[v << 1 | 1];
        } else {
            int a = v << 1;
            if (tmin[v << 1 | 1] < tmin[a]) {
                a = v << 1 | 1;
            }
            tmin[v] = tmin[a];
            cnt[v] = cnt[a];
        }
    }

    int get_free() {
        if (tmin[1] == 0)
            return cnt[1];
        return 0;
    }
};

int a[N];
int cnt[N];
int n;

void add(int i, Tree & tree, int inc = 1) {
    int l = max(1, i - cnt[i] + 1);
    int r = i;
    if (l <= r) {
        tree.upd(1, 1, n, l, r, inc);
    }
}

void rem(int i, Tree & tree) {
    add(i, tree, -1);
}

void smain() {
    int  q;
    cin >> n >> q;
    fori (i, n) {
        cin >> a[i];
        cnt[a[i]]++;
    }

    Tree tree(n);
    for (int i = 1; i <= n; ++i) {
        add(i, tree);
    }
//    watch(tree.get_free());
    fori (_, q) {
        int pos, val;
        cin >> pos >> val;
        pos--;
        if (a[pos] != val) {
            rem(a[pos], tree);
            rem(val, tree);
            cnt[a[pos]]--;
            cnt[val]++;
            add(a[pos], tree);
            add(val, tree);

            a[pos] = val;
        }
        cout << tree.get_free() << '\n';
    }

}


Measured memory_bytes: 12416