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

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef double ld;


#define int ll
#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());


typedef pair<int, int> pii;
typedef pair<string, string> pst;
typedef pair<pii, pii> piii;
typedef vector<piii> vpii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<pii> vpi;
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;
typedef pair<pld, pld> pldd;
typedef vector<pld> vpd;
typedef complex<double> base;


#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define my_abs(a) (((a) >= 0) ? (a) : -(a))
#define mp(a, b) make_pair(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 MODIK(a) (a >= M ? a - M : a)
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cout << (#x) << " = " << x << endl;
#ifdef ART_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif


const double PI = 2 * acos(0.0);

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

istream &operator >> (istream &in, pii &a)
{
    in >> a.first >> a.second;
    return in;
}


ostream &operator << (ostream &out, pii &a)
{
    out << a.first << ' ' << a.second;
    return out;
}


istream &operator >> (istream &in, pld &a)
{
    in >> a.first >> a.second;
    return in;
}


ostream &operator << (ostream &out, pld &a)
{
    out << a.first << ' ' << a.second;
    return out;
}


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, 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 print(int a, int b, int n, vi h)
{
    ofstream cout("output.txt");
    cout << SZ(h) << ' ' << a << ' ' << b << '\n';
    for (int i = 0; i < SZ(h); ++i) {
        cout << h[i]  << ' ';
    }
    cout.close();
    exit(0);
}


inline bool break_time(ld time)
{
    return clock() > CLOCKS_PER_SEC * time;
}


ld get_rand_ld(ld l, ld r)
{
    uniform_real_distribution<double> gen(l, r);
    return gen(rng);
}


bool may(int E, ld T)
{
    if (E < 0)
        return 1;

    double eps = get_rand_ld(0, 1);
    return eps < exp(-E / T);
}


void smain();

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

#ifdef ART_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
    cout << setprecision(12) << fixed;
    smain();
#ifdef ART_HOME
    cout << "\nTOTAL EXECUTIOn TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
}


const int N = 2e5 + 10, K = 1e2 + 10, B = 400, oo = 1e9 + 100, M = 1e9 + 7, LOG = 20;
const int M1 = 1000000093, x1 = 27162;
const int M2 = 1000000087, x2 = 241;
const ld pi = atan2(1, 0) * 2;


int cnt[N], n;
map<int, set<int>> pos;


void dec(int v, set<int> &flex, int &ans)
{
    if (!flex.count(v))
    {
        pos[cnt[v]].erase(v);
        cnt[v]--;
        pos[cnt[v]].insert(v);
        return;
    }

    if (v == n)
    {
        auto pr = prev(flex.lower_bound(v));
        ans -= max(0LL, -(cnt[v] + *pr));

        int val = cnt[v];
        pos[cnt[v]].erase(v);
        cnt[v]--;
        pos[cnt[v]].insert(v);

        auto it = pos[val].lower_bound(v);
        if (it != pos[val].begin() && *prev(it) > *pr)
        {
            it = prev(it);
            ans += max(0LL, -(cnt[v] + *it));
            ans += max(0LL, -(cnt[*it] + *pr));
            flex.insert(*it);
        }
        else {
            ans += max(0LL, -(cnt[v] + *pr));
        }

        return;
    }

    int a = cnt[v];

    flex.erase(v);
    auto pr = prev(flex.lower_bound(v));
    auto nx = flex.upper_bound(v);

    assert(nx != flex.end());
    ans -= max(0LL, -(cnt[v] + *pr));
    ans -= max(0LL, -(cnt[*nx] + v));

    pos[cnt[v]].erase(v);
    cnt[v]--;
    pos[cnt[v]].insert(v);

    auto it = pos[a].upper_bound(*nx);
    int label = 0;

    if (it != pos[a].begin() && *prev(it) > *pr)
    {
        it = prev(it);
        if (*it > *pr)
        {
            ans += max(0LL, -(cnt[*it] + *pr));
            flex.insert(*it);
        }

        a--;
        if (cnt[*nx] == a)
        {
            ans += max(0LL, -(cnt[*nx] + *it));
            return;
        }

        auto it1 = pos[a].upper_bound(*nx);

        if (it1 != pos[a].begin())
        {
            it1 = prev(it1);
            if (*it1 > *it)
            {
                ans += max(0LL, -(cnt[*it1] + *it));
                ans += max(0LL, -(cnt[*nx] + *it1));
                flex.insert(*it1);
                return;
            }
        }

        ans += max(0LL, -(cnt[*nx] + *it));
        return;
    }

    a--;
    it = pos[a].upper_bound(*nx);

    if (it != pos[a].begin())
    {
        it = prev(it);
        if (*it > *pr)
        {
            ans += max(0LL, -(cnt[*it] + *pr));
            if (*it != *nx)
                ans += max(0LL, -(cnt[*nx] + *it));
            flex.insert(*it);
            return;
        }
    }

    assert(0);
}


void inc(int v, set<int> &flex, int &ans)
{
    if (v == n)
    {
        auto pr = prev(flex.lower_bound(v));
        ans -= max(0LL, -(cnt[v] + *pr));

        if (cnt[*pr] == cnt[v] + 1)
        {
            int u = *pr;
            auto it = prev(pr);
            ans -= max(0LL, -(cnt[*pr] + *it));
            pr = it;
            flex.erase(u);
        }

        pos[cnt[v]].erase(v);
        cnt[v]++;
        pos[cnt[v]].insert(v);
        ans += max(0LL, -(cnt[v] + *pr));
        return;
    }

    auto pr = prev(flex.lower_bound(v));
    auto nx = flex.upper_bound(v);
    assert(nx != flex.end());

    if (flex.count(v)) {
        ans -= max(0LL, -(cnt[v] + *pr));
        ans -= max(0LL, -(cnt[*nx] + v));
    }
    else
    {
        ans -= max(0LL, -(cnt[*nx] + *pr));
    }

    pos[cnt[v]].erase(v);
    cnt[v]++;
    pos[cnt[v]].insert(v);

    if (cnt[*pr] <= cnt[v])
    {
        auto it = prev(pr);
        ans -= max(0LL, -(cnt[*pr] + *it));
        ans += max(0LL, -(cnt[v] + *it));
        flex.erase(pr);
        pr = it;
        ans += max(0LL, -(cnt[*nx] + v));
    }
    else
    {
        if (cnt[v] > cnt[*nx])
        {
            ans += max(0LL, -(cnt[v] + *pr));
            ans += max(0LL, -(cnt[*nx] + v));
        }
        else
        {
            ans += max(0LL, -(cnt[*nx] + *pr));
        }
    }

    if (cnt[v] > cnt[*nx])
        flex.insert(v);
}


int count(set<int> flex)
{
    int ans = 0;
    int last = 0;
    for (int v : flex)
    {
        ans += max(0LL, -(cnt[v] + last));
        last = v;
    }

    return ans;
}


int stupid(vi kek)
{
    fill(cnt, cnt + N, 0);
    cnt[0] = oo;
    for (int j = 1; j <= n; ++j)
        cnt[j] -= j;

    for (int v : kek)
        cnt[v]++;

    for (int i = 1; i <= n; ++i)
        pos[cnt[i]].insert(i);

    set<int> flex;
    flex.insert(0);
    vi suf(n + 1, n);

    for (int i = n - 1; i >= 1; --i) {
        if (cnt[i] <= cnt[suf[i + 1]])
            suf[i] = suf[i + 1];
        else
            suf[i] = i;
    }

    int last = 0;

    int cur = 1;
    while (cur <= n)
    {
        cur = suf[cur];
        flex.insert(cur);
        cur++;
    }

    int ans = count(flex);
    return ans;
}



void smain() {
    int q;
    cin >> n >> q;

    vi kek(n);
    for (int i = 0; i < n; ++i)
        cin >> kek[i];

    fill(cnt, cnt + N, 0);
    cnt[0] = oo;
    for (int j = 1; j <= n; ++j)
        cnt[j] -= j;

    for (int v : kek)
        cnt[v]++;

    for (int i = 1; i <= n; ++i)
        pos[cnt[i]].insert(i);

    set<int> flex;
    flex.insert(0);
    vi suf(n + 1, n);

    for (int i = n - 1; i >= 1; --i) {
        if (cnt[i] <= cnt[suf[i + 1]])
            suf[i] = suf[i + 1];
        else
            suf[i] = i;
    }

    int last = 0;

    int cur = 1;
    while (cur <= n)
    {
        cur = suf[cur];
        flex.insert(cur);
        cur++;
    }

    int ans = count(flex);

    for (int i = 0; i < q; ++i)
    {


        int ind, v;
        cin >> ind >> v;
        ind--;

        int pr = kek[ind];
        kek[ind] = v;

        dec(pr, flex, ans);
        inc(v, flex, ans);

        cout << ans << '\n';
    }
}


Measured memory_bytes: 62464