#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ll> vll;
#define forn(i, n) for (int (i) = 0; (i) != (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define fi first
#define se second
#define re return
#define pb push_back
#define uniq(x) sort(all(x)); (x).resize(unique(all(x)) - (x).begin())
#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " " << #x << " " << x << endl
#define ln cerr << __LINE__ << endl
#else
#define dbg(x) void(0)
#define ln void(0)
#endif // LOCAL
const int N = 1100002;
int tree[4 * N];
int valu[4 * N];
int push[4 * N];
int act[4 * N];
void Push(int V, int L, int M, int R)
{
tree[2 * V + 1] += push[V];
valu[2 * V + 1] += push[V];
push[2 * V + 1] += push[V];
tree[2 * V + 2] += push[V];
valu[2 * V + 2] += push[V];
push[2 * V + 2] += push[V];
push[V] = 0;
if (L + 1 == M && !act[2 * V + 1]) tree[2 * V + 1] = 0;
if (M + 1 == R && !act[2 * V + 2]) tree[2 * V + 2] = 0;
}
void Active(int pos, int L = 0, int R = N, int V = 0)
{
if (L + 1 == R)
{
act[V] ^= 1;
if (act[V]) tree[V] = valu[V];
else tree[V] = 0;
return;
}
int M = (L + R) / 2;
Push(V, L, M, R);
if (pos < M) Active(pos, L, M, 2 * V + 1);
else Active(pos, M, R, 2 * V + 2);
tree[V] = max(tree[2 * V + 1], tree[2 * V + 2]);
}
void Add(int l, int r, int x, int L = 0, int R = N, int V = 0)
{
if (l <= L && R <= r)
{
tree[V] += x;
valu[V] += x;
push[V] += x;
if (L + 1 == R && !act[V]) tree[V] = 0;
return;
}
if (R <= l || r <= L)
{
return;
}
int M = (L + R) / 2;
Push(V, L, M, R);
Add(l, r, x, L, M, 2 * V + 1);
Add(l, r, x, M, R, 2 * V + 2);
tree[V] = max(tree[2 * V + 1], tree[2 * V + 2]);
}
int Get()
{
return tree[0];
}
vi countScans(vi a, vi x, vi v)
{
vector<pair<int, int> > elems;
int n = a.size();
int q = x.size();
for (int i = 0; i < n; i++)
{
elems.push_back({a[i], i});
}
for (int i = 0; i < q; i++)
{
elems.push_back({v[i], x[i]});
}
uniq(elems);
map<pii, int> mm;
for (int i = 0; i < elems.size(); i++)
{
mm[elems[i]] = i;
}
for (int i = 0; i < elems.size(); i++)
{
Add(i, i + 1, elems[i].second);
}
for (int i = 0; i < n; i++)
{
a[i] = mm[{a[i], i}];
Active(a[i]);
Add(a[i] + 1, elems.size(), -1);
}
vi ans(q);
for (int i = 0; i < q; i++)
{
int pos = x[i];
Add(a[pos] + 1, elems.size(), 1);
Active(a[pos]);
a[pos] = v[i];
a[pos] = mm[{a[pos], pos}];
Active(a[pos]);
Add(a[pos] + 1, elems.size(), -1);
ans[i] = Get();
}
return ans;
}
#ifdef LOCAL
signed main()
{
int n, q;
cin >> n >> q;
vi a(n), x(q), v(q);
forn(i, n) cin >> a[i];
forn(i, q) cin >> x[i] >> v[i];
vi ans = countScans(a, x, v);
forn(i, q) cout << ans[i] << "\n";
}
#endif // LOCAL
/*
4 2
1 2 3 4
0 3
2 1
10 20
1 2 3 4 5 1 2 3 4 5
0 10
1 9
2 8
3 7
4 6
5 5
6 4
7 3
8 2
9 1
0 10
1 9
2 8
3 7
4 6
5 5
6 4
7 3
8 2
9 1
*/
