#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long unsigned long ull;
typedef double long ld;
int h, w, r[1000005], c[1000005];
pair<int, int> pref_mx[1000005], pref_mn[1000005];
int small_change = 0;
struct SegmentTree {
static const int NODES = 4000005;
pair<pair<int, int>, pair<int, int>> st[NODES];
// .first.first -> pref_mx row
// .first.second -> pref_mx col
// .second.first -> pref_mn row
// .second.second -> pref_mn col
SegmentTree() {
for (int i = 0; i < NODES; i++) {
st[i].first = {0, 0};
st[i].second = {1e9, 1e9};
}
}
pair<pair<int, int>, pair<int, int>> comb(pair<pair<int, int>, pair<int, int>> x, pair<pair<int, int>, pair<int, int>> y) {
pair<pair<int, int>, pair<int, int>> ret;
ret.first.first = max(x.first.first, y.first.first);
ret.first.second = max(x.first.second, y.first.second);
ret.second.first = min(x.second.first, y.second.first);
ret.second.second = min(x.second.second, y.second.second);
return ret;
}
void set(int node, int l, int r, int point, pair<int, int> val) {
if (l == r) {
assert(l == point);
st[node].first = st[node].second = val;
return;
}
int mid = l + r >> 1;
if (point <= mid) set(node * 2, l, mid, point, val);
else set(node * 2 + 1, mid + 1, r, point, val);
st[node] = comb(st[node * 2], st[node * 2 + 1]);
}
pair<pair<int, int>, pair<int, int>> get(int node, int l, int r, int ql, int qr) {
if (l > r || l > qr || r < ql) return {{0, 0}, {1e9, 1e9}};
if (ql <= l && r <= qr) return st[node];
int mid = l + r >> 1;
return comb(get(node * 2, l, mid, ql, qr), get(node * 2 + 1, mid + 1, r, ql, qr));
}
} ST;
void give_initial_chart(int H, int W, vector<int> R, vector<int> C) {
h = H; w = W;
for (int i = 0; i < h * w; i++) r[i] = R[i];
for (int i = 0; i < h * w; i++) c[i] = C[i];
pref_mx[0] = pref_mn[0] = {r[0], c[0]};
for (int i = 1; i < h * w; i++) {
pref_mx[i].first = max(pref_mx[i - 1].first, r[i]);
pref_mx[i].second = max(pref_mx[i - 1].second, c[i]);
pref_mn[i].first = min(pref_mn[i - 1].first, r[i]);
pref_mn[i].second = min(pref_mn[i - 1].second, c[i]);
}
for (int i = 0; i < h * w; i++) {
if ((pref_mx[i].first - pref_mn[i].first + 1) * (pref_mx[i].second - pref_mn[i].second + 1) == i + 1) {
small_change++;
}
}
for (int i = 0; i < h * w; i++) {
ST.set(1, 1, h * w, i + 1, {r[i], c[i]});
}
}
int swap_seats(int a, int b) {
/*if (h * w <= 10000) {
swap(r[a], r[b]);
swap(c[a], c[b]);
int ans = 0;
pair<int, int> mn, mx;
mx = mn = {r[0], c[0]};
for (int i = 0; i < h * w; i++) {
mx.first = max(mx.first, r[i]);
mx.second = max(mx.second, c[i]);
mn.first = min(mn.first, r[i]);
mn.second = min(mn.second, c[i]);
if ((mx.first - mn.first + 1) * (mx.second - mn.second + 1) == i + 1) {
ans++;
}
}
return ans;
}
if (abs(a - b) <= 10000) {
if (a > b) swap(a, b);
for (int i = a; i <= b; i++) {
if ((pref_mx[i].first - pref_mn[i].first + 1) * (pref_mx[i].second - pref_mn[i].second + 1) == i + 1) {
small_change--;
}
}
swap(r[a], r[b]);
swap(c[a], c[b]);
for (int i = a; i <= b; i++) {
if (i == 0) pref_mx[i] = pref_mn[i] = {r[i], c[i]};
else {
pref_mx[i].first = max(pref_mx[i - 1].first, r[i]);
pref_mx[i].second = max(pref_mx[i - 1].second, c[i]);
pref_mn[i].first = min(pref_mn[i - 1].first, r[i]);
pref_mn[i].second = min(pref_mn[i - 1].second, c[i]);
}
}
for (int i = a; i <= b; i++) {
if ((pref_mx[i].first - pref_mn[i].first + 1) * (pref_mx[i].second - pref_mn[i].second + 1) == i + 1) {
small_change++;
}
}
return small_change;
}*/
if (h <= 1000 && w <= 1000) {
ST.set(1, 1, h * w, a + 1, {r[b], c[b]});
ST.set(1, 1, h * w, b + 1, {r[a], c[a]});
swap(r[a], r[b]);
swap(c[a], c[b]);
int curr = 1, ans = 0;
while (curr <= h * w) {
pair<pair<int, int>, pair<int, int>> rect = ST.get(1, 1, h * w, 1, curr);
int P = (rect.first.first - rect.second.first + 1) * (rect.first.second - rect.second.second + 1);
assert(P >= curr);
if (P == curr) ans++, curr++;
else curr = P;
}
return ans;
}
return 0;
}
