#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "seats.h"
struct RECTANGLE {
int mnx, mxx, mny, mxy;
RECTANGLE() {
mnx = mny = +2e9;
mxx = mxy = -2e9;
}
void addcell(int x, int y) {
setmin(mnx, x);
setmax(mxx, x);
setmin(mny, y);
setmax(mxy, y);
}
int area() {
return (mxx-mnx+1) * (mxy-mny+1);
}
};
int n, m;
VPI tex;
int ans;
vector<RECTANGLE> pref;
void give_initial_chart(int H, int W, VI R, VI C) {
n = H;
m = W;
rep(i, n*m) tex.pb({R[i], C[i]});
pref = vector<RECTANGLE>(n*m+1);
replr(i, 1, n*m) {
pref[i] = pref[i-1];
auto[x, y] = tex[i-1];
pref[i].addcell(x, y);
ans += (i == pref[i].area());
}
}
int swap_seats(int a, int b) {
/*replr(i, 1, n*m) cout << (i == pref[i].area) << " "; cout << endl;*/
swap(tex[a], tex[b]);
ans = 0;
replr(i, 1, n*m) {
pref[i] = pref[i-1];
auto[x, y] = tex[i-1];
pref[i].addcell(x, y);
ans += (i == pref[i].area());
}
return ans;
}
