#include <iostream>
#include <vector>
#include <algorithm>
#include <fstream>
#include <queue>
#include <deque>
#include <iomanip>
#include <cmath>
#include <set>
#include <stack>
#include <map>
#include <unordered_map>
using namespace std;
#define FOR(i,n) for(int me=0;me<n;me++)
#define FORE(i,a,b) for(int i=a;i<=b;i++)
#define ll long long
//#define int long long
#define ld long double
#define vi vector<int>
#define pb push_back
#define ff first
#define ss second
#define ii pair<int,int>
#define iii pair<ii,int>
#define il pair<ll,ll>
#define vv vector
#define endl '\n'
int count_swaps( vector < int > vc ){
if (vc[0] < vc[1]) {
return 0;
}
else if (vc[0] > vc[1]) {
return 1;
}
else {
return 2;
}
}
