#include <bits/stdc++.h>
#pragma GCC optimize("-O3")
using namespace std;
const long long N = 1e6 + 5;
void pairsort(long long a[], long long b[], long long n) {
  pair<long long, long long> pairt[n];
  for (long long i = 0; i < n; i++) {
    pairt[i].first = a[i];
    pairt[i].second = b[i];
  }
  sort(pairt, pairt + n);
  for (long long i = 0; i < n; i++) {
    a[i] = pairt[i].first;
    b[i] = pairt[i].second;
  }
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long isPrime(long long n) {
  if (n < 2) return 0;
  if (n < 4) return 1;
  if (n % 2 == 0 or n % 3 == 0) return 0;
  for (long long i = 5; i * i <= n; i += 6)
    if (n % i == 0 or n % (i + 2) == 0) return 0;
  return 1;
}
long long C(long long n, long long r) {
  if (r > n - r) r = n - r;
  long long ans = 1;
  for (long long i = 1; i <= r; i++) {
    ans *= n - r + i;
    ans /= i;
  }
  return ans;
}
long long mod = 1e9 + 7;
long long modexpo(long long x, long long p) {
  long long res = 1;
  x = x % mod;
  while (p) {
    if (p % 2) res = res * x;
    p >>= 1;
    x = x * x % mod;
    res %= mod;
  }
  return res;
}
long long t, n, q, a[N], x, y, z;
multiset<long long> s1;
multiset<long long, greater<long long>> s2;
multiset<long long, greater<long long>> d;
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n >> q;
  s1.insert(LLONG_MAX), s2.insert(LLONG_MIN);
  for (long long i = 1; i <= n; i++)
    cin >> a[i], s1.insert(a[i]), s2.insert(a[i]);
  sort(a + 1, a + n + 1);
  for (long long i = 2; i <= n; i++) d.insert(a[i] - a[i - 1]);
  long long mi;
  long long mx;
  long long max_diff;
  if (d.size() > 1)
    mi = *s1.begin(), mx = *s2.begin(), max_diff = *d.begin();
  else
    mi = mx = max_diff = 0;
  cout << mx - mi - max_diff << "\n";
  while (q--) {
    cin >> z >> x;
    if (z == 0) {
      s1.erase(x), s2.erase(x);
      long long x1 = *s1.lower_bound(x);
      long long x2 = *s2.lower_bound(x);
      if (x1 != LLONG_MAX) d.erase(d.find(x1 - x));
      if (x2 != LLONG_MIN) d.erase(d.find(x - x2));
      if (x1 != LLONG_MAX && x2 != LLONG_MIN) d.insert(x1 - x2);
    } else {
      long long x1 = *s1.lower_bound(x);
      long long x2 = *s2.lower_bound(x);
      if (x1 != LLONG_MAX && x2 != LLONG_MIN) d.erase(d.find(x1 - x2));
      s1.insert(x);
      s2.insert(x);
      if (x1 != LLONG_MAX) d.insert(x1 - x);
      if (x2 != LLONG_MIN) d.insert(x - x2);
    }
    if (d.size() > 0)
      mi = *s1.begin(), mx = *s2.begin(), max_diff = *d.begin();
    else
      mi = mx = max_diff = 0;
    cout << mx - mi - max_diff << "\n";
  }
  return 0;
}
