#include "vision.h"
#include<bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define debug(x) {cerr<<#x<<"="<<x<<"\n";}
#define debug2(x, y) {cerr<<"{"<<#x<<", "<<#y<<"}={"<<x<<", "<<y<<"}\n";}
#define debugp(p) {cerr<<#p<<"={"<<p.first<<", "<<p.second<<"}\n";}
#define debugv(abcd) {cerr<<#abcd<<": ";for (auto dcba:abcd) cerr<<dcba<<", ";cerr<<"\n";}
#define pb push_back
#define SZ(x) ((int)x.size())
#define all(x) x.begin(), x.end()
const int inf=1000001000; // 1e9
const ll INF=10000000010000000; // 1e16
const int mod=1000000007;
const int MAXN=100010;
int n, m, k;
inline int get_id(int x, int y){ return x*m+y;}
void construct_network(int _n, int _m, int _k){
n=_n;
m=_m;
k=_k;
vi shit;
for (int i=0; i<n; i++) for (int j=0; j<m; j++){
vi vec;
for (int ii=0; ii<n; ii++) for (int jj=0; jj<m; jj++)
if (abs(i-ii)+abs(j-jj)==k && pii(i, j)<pii(ii, jj)) vec.pb(get_id(ii, jj));
if (vec.empty()) continue ;
int a=add_or(vec);
shit.pb(add_and({a, get_id(i, j)}));
}
add_or(shit);
}
