#include "vision.h"
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

template <class T> using Vec = std::vector<T>;
#define L(i, l, r) for (int i = (l); i < (r); ++i)
#define R(i, l, r) for (int i = (r - 1); i >= (l); --i)
#define ALL(x) (x).begin(), (x).end()
#define sz(x) (int)(x.size())

int startH, endH, startW, endW;

int startDisTableH, endDisTableH;
int startDisTableW, endDisTableW;
int startATableH, endATableH;
int startATableW, endATableW;

int nwId;

void construct_network(int H, int W, int K) {
	nwId = H * W;
	startH = nwId;
	endH = nwId + H;
	nwId += H;
	L(i, 0, H) {
		Vec<int> ns;
		L(j, 0, W) ns.push_back(i * W + j);
		add_or(ns);
	}
	startW = nwId;
	endW = nwId + W;
	nwId += W;
	L(j, 0, W) {
		Vec<int> ns;
		L(i, 0, H) ns.push_back(i * W + j);
		add_or(ns);
	}

	startDisTableH = nwId, endDisTableH = nwId + H * (H + 1) / 2;
	Vec<int> spns;
	L(i, 0, H) spns.push_back(startH + i);
	Vec<int> spnw;
	L(i, 0, W) spnw.push_back(startW + i);
	L(i, 0, H) L(j, i, H) {
		if (i == j) add_xor(spns);
		else add_and({startH + i, startH + j});
	}
	nwId += H * (H + 1) / 2;
	startDisTableW = nwId, endDisTableW = nwId += W * (W + 1) / 2;
	L(i, 0, W) L(j, i, W) {
		if (i == j) add_xor(spnw);
		else add_and({startW + i, startW + j});
	}
	startATableH = nwId, endATableH = nwId += H;
	L(i, 0, H) {
		Vec<int> ns;
		int cnt = 0;
		L(a, 0, H) L(b, a, H) {
			if (b - a == i) ns.push_back(startDisTableH + cnt);
			++cnt;
		}
		add_or(ns);
	}
	startATableW = nwId, endATableW = nwId += W;
	L(i, 0, W) {
		Vec<int> ns;
		int cnt = 0;
		L(a, 0, W) L(b, a, W) {
			if (b - a == i) ns.push_back(startDisTableW + cnt);
			++cnt;
		}
		add_or(ns);
	}

	int startX = nwId;
	L(i, 0, H) {
		L(j, 0, W) {
			if (i + j == K) {
				Vec<int> ns = {startATableH + i, startATableW + j};
				add_and(ns);
				++nwId;
			}
		}
	}
	Vec<int> ns;
	L(i, startX, nwId) ns.push_back(i);
	add_or(ns);
}