#include "vision.h"
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vii;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vii> vvii;
typedef vector<vll> vvll;
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
#define ffor(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) ffor(i, 0, n)
#define forin(x, a) for (auto &x: a)
#define all(a) a.begin(), a.end()
void construct_network(int H, int W, int K) {
map<int, vii> diaga, diagb;
rep(i, H) {
rep(j, W) {
int k = W * i + j;
diaga[i + j].emplace_back(k);
diagb[i - j].emplace_back(k);
}
}
vii inda, indb, res;
forin(diag, diaga) {
inda.emplace_back(add_or(diag.second));
}
forin(diag, diagb) {
indb.emplace_back(add_or(diag.second));
}
vii deltaa, deltab;
vii dkaa, dkbb, ckaa, ckbb;
rep(i, inda.size() - K) {
dkaa.emplace_back(add_and({inda[i], inda[i + K]}));
vii curr;
ffor(j, i, i + K + 1) {
forin(pnt, diaga[j]) {
curr.emplace_back(pnt);
}
}
int pres = add_or(curr);
int odd = add_not(add_xor(curr));
ckaa.emplace_back(add_and({pres, odd}));
}
rep(i, indb.size() - K) {
dkbb.emplace_back(add_and({indb[i], indb[i + K]}));
vii curr;
ffor(j, i, i + K + 1) {
forin(pnt, diaga[j + diaga.begin()->first]) {
curr.emplace_back(pnt);
}
}
int pres = add_or(curr);
int odd = add_not(add_xor(curr));
ckbb.emplace_back(add_and({pres, odd}));
}
int dka = add_or(dkaa), dkb = add_or(dkbb), cka = add_or(ckaa), ckb = add_or(ckbb);
add_and({add_or({dka, dkb}), cka, ckb});
}
