/*************************************
* author: marvinthang *
* created: 28.06.2023 17:58:24 *
*************************************/
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define left ___left
#define right ___right
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define MASK(i) (1LL << (i))
#define BIT(x, i) ((x) >> (i) & 1)
#define __builtin_popcount __builtin_popcountll
#define ALL(v) (v).begin(), (v).end()
#define REP(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define REPD(i, n) for (int i = (n); i--; )
#define FOR(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define FORD(i, b, a) for (int i = (b), _a = (a); --i >= _a; )
#define FORE(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORDE(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
#define scan_op(...) istream & operator >> (istream &in, __VA_ARGS__ &u)
#define print_op(...) ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
#include "debug.h"
#else
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define DB(...) 23
#define db(...) 23
#define debug(...) 23
#endif
template <class U, class V> scan_op(pair <U, V>) { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>) { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>) { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")"; else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
// end of template
void construct_network(int H, int W, int K) {
int total = H + W - 1;
vector <vector <int>> sum(total), diff(total);
REP(i, H) REP(j, W) {
sum[i + j].push_back(i * W + j);
diff[i - j + W - 1].push_back(i * W + j);
}
vector <int> or_sum(total), xor_sum(total), or_diff(total), xor_diff(total);
REP(i, total) {
or_sum[i] = add_or(sum[i]);
xor_sum[i] = add_xor(sum[i]);
or_diff[i] = add_or(diff[i]);
xor_diff[i] = add_xor(diff[i]);
}
vector <int> fs, fd;
REP(i, total - K) {
vector <int> or_sr, xor_sr, or_dr, xor_dr;
REP(j, K + 1) {
or_sr.push_back(or_sum[i + j]);
xor_sr.push_back(xor_sum[i + j]);
or_dr.push_back(or_diff[i + j]);
xor_dr.push_back(xor_diff[i + j]);
}
vector <int> a {add_or(or_sr), add_not(add_xor(xor_sr))};
fs.push_back(add_and(a));
a = {add_or(or_dr), add_not(add_xor(xor_dr))};
fd.push_back(add_and(a));
}
int p1 = add_and(vector<int>{add_or(fs), add_or(fd)});
fs.clear(); fd.clear();
REP(i, total - K + 1) {
vector <int> or_sr, xor_sr, or_dr, xor_dr;
REP(j, K) {
or_sr.push_back(or_sum[i + j]);
xor_sr.push_back(xor_sum[i + j]);
or_dr.push_back(or_diff[i + j]);
xor_dr.push_back(xor_diff[i + j]);
}
vector <int> a {add_or(or_sr), add_not(add_xor(xor_sr))};
fs.push_back(add_and(a));
a = {add_or(or_dr), add_not(add_xor(xor_dr))};
fd.push_back(add_and(a));
}
int p2 = add_not(add_and(vector<int>{add_or(fs), add_or(fd)}));
add_and(vector<int> {p1, p2});
}
