#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define f0r(i, n) for (auto i = 0; i < (n); ++i)
#define fnr(i, n, k) for (auto i = (n); i < (k); ++i)
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define F first
#define S second
#define ctn(x) cout << x << '\n'
#define forl(a, l) for (auto a : l)
#define ctl(l) for (auto &a : (l)) cout << a << ' '; cout << endl;
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define ub(v, x) (upper_bound(all(v), x) - begin(v))
#define pq priority_queue
template <class T>
using V = vector<T>;
using ll = long long;
using vi = V<int>;
using vl = V<ll>;
using pi = pair<int, int>;
using ti = tuple<int, int, int>;
using Adj = V<vi>;
using vvi = V<vi>;
#include "vision.h"
void construct_network(int H, int W, int K) {
auto enc = [=](int x, int y) { return x*W+y; };
auto enc2 = [=](int a) { return H*W+a; };
// ROW, COL
int cnt = 0;
vi c;
f0r(r1, H) f0r(c1, W) f0r(r2, H) f0r(c2, W) if (r1 == 0 && c1 == 0 && r1 <= r2 && (r1 != r2 || c1 <= c2) && abs(r2-r1)+abs(c2-c1) == K) {
add_and({enc(r1, c1), enc(r2, c2)});
c.pb(enc2(cnt++));
}
add_or(c);
return;
if (H == 1) {
vi c;
f0r(i, W-K) {
add_and({enc(0, i), enc(0, i+K)});
c.pb(enc2(i));
}
add_or(c);
} else {
vi c;
f0r(i, H-K) {
add_and({enc(i, 0), enc(i+K, 0)});
c.pb(enc2(i));
}
add_or(c);
}
//std::vector<int> Ns;
//Ns = {0, 1};
//int a = add_and(Ns);
//Ns = {0, a};
//int b = add_or(Ns);
//Ns = {0, 1, b};
//int c = add_xor(Ns);
//add_not(c);
}
