#include "vision.h"
#include "bits/stdc++.h"
//#define int long long
#define all(v) v.begin() , v.end()
#define sz(a) (int)a.size()
using namespace std;
int N,M;
inline int get_ind(int a,int b){
return a*M+b;
}
inline bool is_valid(int a,int b){
return a>=0 && a<N && b>=0 && b<M;
}
void construct_network(int n, int m, int k){
N=n,M=m;
if(max(n,m)<=30){
vector<int> query;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
for(int z=0;z<n;z++){
for(int y=0;y<m;y++){
if(abs(i-z)+abs(j-y)==k){
vector<int> xd;
xd.push_back(get_ind(i,j));
xd.push_back(get_ind(z,y));
query.push_back(add_and(xd));
}
}
}
}
}
add_or(query);
return;
}
if(min(n,m)!=1){
vector<int> query;
int a = 0, b = k;
for(int u=0;u<3*max(N,M);u++){
if(is_valid(a,b)){
vector<int> xd;
xd.push_back(get_ind(0,0));
xd.push_back(get_ind(a,b));
query.push_back(add_and(xd));
}
a++,b--;
}
add_or(query);
return;
}
if(n==1){
vector<int> query;
for(int i=0;i+k<m;i++){
vector<int> xd;
xd.push_back(i);
xd.push_back(i+k);
query.push_back(add_and(xd));
}
add_or(query);
}
else{
vector<int> query;
for(int i=0;i+k<n;i++){
vector<int> xd;
xd.push_back(i);
xd.push_back(i+k);
query.push_back(add_and(xd));
}
add_or(query);
}
}
