#include "vision.h"
#ifdef NYAOWO
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i,a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define eb emplace_back
// #define int LL
using namespace std;
using LL = long long;
using pii = pair<int, int>;
void construct_network(int H, int W, int K) {
// 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);
vector<vector<int>> row(H);
vector<vector<int>> col(W);
For(i, 0, H - 1) For(j, 0, W - 1) {
int id = i * W + j;
row[i].eb(id);
col[j].eb(id);
}
vector<int> or_row(H);
vector<int> or_col(W);
For(i, 0, H - 1) or_row[i] = add_or(row[i]);
For(i, 0, W - 1) or_col[i] = add_or(col[i]);
vector<int> adj;
int a, b;
if(H >= 2) {
adj.clear();
For(i, 0, H - 2) {
adj.eb(add_and({or_row[i], or_row[i + 1]}));
}
a = add_and({add_xor(or_col), add_or(adj)});
}
if(W >= 2) {
adj.clear();
For(i, 0, W - 2) {
adj.eb(add_and({or_col[i], or_col[i + 1]}));
}
b = add_and({add_xor(or_row), add_or(adj)});
}
if(H >= 2 && W >= 2) {
add_or({a, b});
}
}
