D innopolis

//나는 가상 소녀들에게 큰 호감이 있습니다.

#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <chrono>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <deque>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <stdarg.h>
#include <utility>

using namespace std;

#define pb push_back
#define mp make_pair
#define ll long long
#define ull unisgned long long
#define ld long double
#define all(a) a.begin(), a.end()
#define SORT(a) sort(all(a))
#define pii pair<int, int>
#define tii triple<int, int, int>
#define e 1e-7
#define PI acos(-1)
#define sz(a) (int)(a.size())
#define inf 1e17
#define vi vector<int>
#define F first
#define S second
#define rng(x) for(int _ = 0; _ < (x); _++)
#define rngi(i, x) for(int i = 0; i < (x); i++)
#define rngsi(s, i, x) for(int i = (s); i <(x); i++)
#define int long long
#define problem "a"

template<typename A, typename B, typename C>
struct triple {
	A X;
	B Y;
	C Z;
	triple(A a = 0, B b = 0, C c = 0) :X(a), Y(b), Z(c) {}
};
template<typename A, typename B, typename C>
triple<A, B, C> make_triple(A a = 0, B b = 0, C c = 0) {
	return triple<A, B, C>(a, b, c);
}
template<typename A, typename B, typename C>
bool operator<(const triple<A, B, C>& a, const triple<A, B, C>& b) {
	if (a.X != b.X)
		return a.X < b.X;
	if (a.Y != b.Y)
		return a.Y < b.Y;
	return a.Z < b.Z;
}
template<typename T, typename SS>
ostream& operator<<(ostream& ofs, const pair<T, SS>& p) {
	ofs << "( " << p.F << " , " << p.S << " )";
	return ofs;
}
template<typename T>
void print(T a) {
	for (auto i : a)
		cout << i << ' ';
	cout << '\n';
}
template<typename T>
T max(T a, T b, T c) {
	return max(a, max(b, c));
}
template<typename T>
T min(T a, T b, T c) {
	return min(a, min(b, c));
}
template<typename T, typename D>
D min(T a) {
	return *min_element(all(a));
}
template<typename T, typename D>
D max(T a) {
	return *max_element(all(a));
}
struct custom_hash {
	static uint64_t splitmix64(uint64_t x) {
		x += 0x9e3779b97f4a7c15;
		x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
		x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
		return x ^ (x >> 31);
	}

	size_t operator()(uint64_t x) const {
		static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
		return splitmix64(x + FIXED_RANDOM);
	}
};
struct node {
	int ans;
	int s;
	int le, re;
	int sl, pl;
	node() { ans = s = le = re = sl = pl = 0; }
};
node mrg(const node& l, const node& r) {
	node res;
	res.le = l.le; res.re = r.re;
	res.ans = max(res.ans, l.ans, r.ans);
	res.s = l.s + r.s;
	if (l.re < r.le) {
		res.ans = max(res.ans, l.sl + r.pl);
		if (r.pl == r.s) res.sl = l.sl + r.s;
		else res.sl = r.sl;
		if (l.pl == l.s) res.pl = r.pl + l.s;
		else res.pl = l.pl;
	}
	else {
		res.sl = r.sl;
		res.pl = l.pl;
	}
	return res;
};
vector<node> tree;
void build(int v, int l, int r, vi& c) {
	if (l > r)return;
	if (l == r) {
		tree[v].le = tree[v].re = c[l];
		tree[v].ans = tree[v].sl = tree[v].pl = 1;
		tree[v].s = 1;
		return;
	}
	int m = l + r >> 1;
	build(v << 1, l, m, c); build(v << 1 | 1, m + 1, r, c);
	tree[v] = mrg(tree[v << 1], tree[v << 1 | 1]);
}
void ch(int v, int l, int r, int pos, int x) {
	if (l > r)return;
	if (l == r) {
		tree[v].le = tree[v].re = x;
		return;
	}
	int m = l + r >> 1;
	if (pos <= m)ch(v << 1, l, m, pos, x);
	else ch(v << 1 | 1, m + 1, r, pos, x);
	tree[v] = mrg(tree[v << 1], tree[v << 1 | 1]);
}
void solve() {
	int n, m; cin >> n >> m;
	vi a(n); rngi(i, n) cin >> a[i], a[i]--;
	vi p(n); rngi(i, n)p[a[i]] = i;
	tree.resize(4 * n);
	build(1, 0, n - 1, p);
	auto calc = [&]() {
		//build(1, 0, n - 1, p);
		return n - tree[1].ans;
		int z = 1;
		int i = 0;
		while (i < n) {
			int d = 1;
			while (i + d < n && p[i + d - 1] < p[i + d])d++;
			z = max(z, d);
			i = i + d;
		}
		return n - z;
	};
	cout << calc() << '\n';
	rng(m) {
		int x, y; cin >> x >> y;
		int u = p[a[x - 1]], v = p[a[y - 1]];
		ch(1, 0, n - 1, a[x - 1], v);
		ch(1, 0, n - 1, a[y - 1], u);
		swap(p[a[x - 1]], p[a[y - 1]]);
		swap(a[x - 1], a[y - 1]);
		cout << calc() << '\n';
	}
};
signed main()
{
	if (0) {
		freopen(problem".in", "r", stdin);
		freopen(problem".out", "w", stdout);
	}
	srand(time(NULL));
	cin.tie(0);
	cout.tie(0);
	ios_base::sync_with_stdio(false);
	int t = 1;// cin >> t;
	rng(t) solve();
}