#include "vision.h"
#include <bits//stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less<long long>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_multiset;
#define ll long long
#define iloop(m, h) for (auto i = m; i != h; i += (m < h ? 1 : -1))
#define jloop(m, h) for (auto j = m; j != h; j += (m < h ? 1 : -1))
#define kloop(m, h) for (auto k = m; k != h; k += (m < h ? 1 : -1))
#define lloop(m, h) for (auto l = m; l != h; l += (m < h ? 1 : -1))
#define pll pair<ll, ll>
#define INF 1000000000000000
#define MOD1 1000000007
#define MOD2 998244353
#define MOD3 1000000009
void construct_network(int H, int W, int K) {
vector<int> toq;
ll ci;
vector<ll> r1, r2;
iloop(0, H + W - 1) {
ci = min(i, W-1);
toq.clear();
while (ci >= 0 && i - ci <= H-1) {
toq.push_back((i - ci)*W + ci);
ci--;
}
r1.push_back(add_or(toq));
}
iloop(0, H + W - 1) {
ci = min(i, W-1);
toq.clear();
while (ci >= 0 && i - ci <= H-1) {
toq.push_back((i - ci)*W + W - 1 - ci);
ci--;
}
r2.push_back(add_or(toq));
}
vector<int> v1, v2;
iloop(0, H + W - 1 - K) {
toq.clear();
toq.push_back(r1[i]);
toq.push_back(r1[i+K]);
v1.push_back(add_and(toq));
toq.clear();
toq.push_back(r2[i]);
toq.push_back(r2[i+K]);
v1.push_back(add_and(toq));
}
iloop(0, H + W - 1 - K) {
toq.clear();
jloop(0, K+1) toq.push_back(r1[i+j]);
v2.push_back(add_and({add_or(toq), add_not(add_xor(toq))}));
}
add_and({add_or(v1), add_or(v2)});
}
