#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
#define F first
#define S second
#define endl '\n'
#define all(x) (x).begin(),(x).end()
#ifdef dremix
#define p(x) cerr<<#x<<" = "<<x<<endl;
#define p2(x,y) cerr<<#x<<" , "<<#y<<" = "<<x<<" , "<<y<<endl;
#define pp(x) cerr<<#x<<" = ("<<x.F<<" , "<<x.S<<")"<<endl;
#define pv(x) cerr<<#x<<" = {";for(auto u : x)cerr<<u<<", ";cerr<<"}"<<endl;
#define ppv(x) cerr<<#x<<" = {";for(auto u : x)cerr<<u.F<<"-"<<u.S<<", ";cerr<<"}"<<endl;
#else
#define p(x)
#define p2(x,y)
#define pp(x)
#define pv(x)
#define ppv(x)
#endif
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const int maxp = 22;
const ld EPS = 1e-18;
const ll INF = 1e18;
const int MOD = 1e9+7;
int N,M;
bool valid(int i, int j){
return (i>=0 && i<N && j>=0 && j<M);
}
void construct_network(int n, int m, int k) {
N = n;
M = m;
int arr[n][m];
int i,j,di;
//int temp = add_not(0);
vector<int> asks;
map<pi,bool> v;
for(i=0;i<n;i++)
for(j=0;j<m;j++){
vector<int> idx;
int curr = i*m+j;
idx.push_back(curr);
for(di=-k;di<=k;di++){
int dj = k - abs(di);
if(valid(i+di,j+dj)){
int nxt = (i+di)*m+j+dj;
if(!v[{min(nxt,curr),max(nxt,curr)}]){
idx.push_back(nxt);
v[{min(nxt,curr),max(nxt,curr)}]=true;
}
}
//if(dj && valid(i+di,j-dj))
// idx.push_back((i+di)*m+j-dj);
}
p2(i,j)
pv(idx)
asks.push_back(add_xor(idx));
asks.push_back(add_or(idx));
}
pv(asks)
vector<int> fin;
for(i=0;i<asks.size();i+=2)
fin.push_back(add_xor({asks[i],asks[i+1]}));
pv(fin)
int temp = add_or(fin);
return;
}
/// g++ grader.cpp vision.cpp -Ddremix
