#ifndef LOCAL
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC diagnostic ignored "-Wpedantic"
#endif
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
auto seed = chrono::high_resolution_clock::now().time_since_epoch().count();
mt19937 rnd(52);
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename V>
using table = gp_hash_table<T, V>;
using i128 = __int128;
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
const ll INF = 2e18;
const int inf = 2e9;
const int maxn = 1e5;
const int MOD = 988244353;
const ld pi = acos(-1);
const int P = 5167;
const int L = 26;
const ld EPS = 1e-7;
template<typename T, typename V>
void fill(T &container, V value) {
for (auto &c: container)
c = value;
}
int Bob(vector<int> t);
int Alice(int m, int e, vector<int> u, std::vector<int> v, int n, std::vector<int> p) {
int cnt = 0;
for (int i = 0; i < n; ++i) {
if (p[i] == i) cnt++;
}
if (p[u[0]] == u[0] || p[v[0]] == v[0]) {
Bob({u[0], v[0]});
cnt -= (p[u[0]] == u[0]);
cnt -= (p[v[0]] == v[0]);
}
return cnt;
}
