/// In The Name Of God
#include "sorting.h"
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()
#define rep(i, l, r) for (int i = (l); i < (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i--)
#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define nl '\n'
#define ioi exit(0);
const int MAXN = (int)2e5 + 7;
using namespace std;
int n, m;
int a[MAXN], b[MAXN], x[MAXN], y[MAXN];
bool check(int len) {
rep(i, 0, n) {
b[i] = a[i];
}
rep(i, 0, len) {
swap(b[x[i]], b[y[i]]);
}
int cnt = 0;
rep(i, 0, n) {
if (b[i] != i) {
++cnt;
swap(b[i], b[b[i]]);
}
}
if (cnt > len) return 0;
return 1;
}
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
{
n = N;
m = M;
rep(i, 0, n) {
a[i] = S[i];
}
rep(i, 0, m) {
x[i] = X[i];
y[i] = Y[i];
}
} // copying
int l = 1, r = M, res = -1;
while (l <= r) {
int mid = (l + r) >> 1;
if (check(mid)) res = mid, r = mid - 1;
else l = mid + 1;
}
assert(res != -1);
// opt len found
rep(i, 0, n) {
b[i] = a[i];
}
rep(i, 0, res) {
swap(b[x[i]], b[y[i]]);
}
set <int> st;
int go[n];
rep(i, 0, n) {
if (b[i] != i) {
st.insert(b[i]);
}
go[b[i]] = i;
}
int ptr = 0;
while (sz(st)) {
int x = *st.begin();
st.erase(st.begin());
if (go[x] == x) continue;
swap(a[X[ptr]], a[Y[ptr]]);
//swap(go[a[X[ptr]]], go[a[Y[ptr]]]);
//cerr << x << nl;
int p1 = find(a, a + n, x) - a;
rep(i, 0, n) {
if (go[i] == x) {
int p2 = find(a, a + n, i) - a;
P[ptr] = p1;
Q[ptr] = p2;
swap(go[x], go[i]);
swap(a[p1], a[p2]);
ptr++;
break;
}
}
}
if (!sz(st)) {
P[ptr] = X[ptr];
Q[ptr] = Y[ptr];
}
return res;
}
#ifdef IOI2018
namespace gen {
int get(int x, bool ok = 1) {
}
void gen() {
int N, M;
N = rand() % 5 + 1;
int *S = (int*)malloc(sizeof(int) * (unsigned int)N);
for (int i = 0; i < N; ++i)
S[i] = i;
random_shuffle(S, S + N);
printf ("%d\n", N);
int A[N];
for (int i = 0; i < N; i++) {
A[i] = S[i];
printf ("%d ", A[i]);
}
printf ("\n");
M = rand() % 5 + 1;
printf ("%d\n", M);
int *X = (int*)malloc(sizeof(int) * (unsigned int)M), *Y = (int*)malloc(sizeof(int) * (unsigned int)M);
for (int i = 0; i < M; ++i) {
X[i] = rand() % N + 1;
Y[i] = rand() % N + 1;
printf ("%d %d\n", X[i], Y[i]);
}
int *P = (int*)malloc(sizeof(int) * (unsigned int)M), *Q = (int*)malloc(sizeof(int) * (unsigned int)M);
int ans = findSwapPairs(N, S, M, X, Y, P, Q);
printf("%d\n", ans);
assert(ans <= 30 * N);
for (int i = 0; i < ans; ++i) {
swap(A[X[i]], A[Y[i]]);
swap(A[P[i]], A[Q[i]]);
}
for (int i = 0; i < N; i++) {
printf("%d ", A[i]);
}
}
}
int main() {
gen :: gen();
}
#endif
