#include "sorting.h"
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
using namespace std;
typedef int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=a; i<b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define INF ((ll) pow(2,63) -1)
ll insig;
#define In(vecBRO, LENBRO) REP(IBRO,0,LENBRO) {cin>>insig; vecBRO.pb(insig);}
void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[])
{
ll c1,c2;
REP(i,0,M)
{
c1 = S[X[i]]; c2 = S[Y[i]];
S[X[i]] = c2; S[Y[i]] = c1;
}
vector<ll> pos;
REP(i,0,N) {pos.pb(0);}
REP(i,0,N) {pos[S[i]]=i;}
ll last=0;
REP(i,0,N)
{
if(pos[i]!=i)
{
P[last] = i; Q[last] = pos[i];
c1 = S[i]; c2 = S[pos[i]];
S[i] = c2; S[pos[i]] = c1;
pos[i] = i; pos[c1] = Q[last];
last++;
}
}
return last;
}
/*int main()
{
ll N,M; cin>>N>>M; int S[N]; REP(i,0,N) {cin>>S[i];}
int X[M],Y[M]; REP(i,0,M) {cin>>X[i]>>Y[i];}
int P[M], Q[M];
cout<<findSwapPairs(N,S,M,X,Y,P,Q)<<endl;
}*/
