#include <bits/stdc++.h>
#include "vision.h"
#define fi first
#define se second
#define ssize(x) int(x.size())
#define pn printf("\n")
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(), x.rend()
#define vv vector
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int M;
int Hash(int i, int j){ return i*M+j; }
void construct_network(int n, int m, int k){
M = m;
vv<int> queries;
for(int i = 0; i < 1; ++i){
for(int j = 0; j < 1; ++j){
vv<int> ask;
for(int l = 0; l <= k; ++l){
if(j-k+l >= 0 && i+l < n) ask.emplace_back(Hash(i+l, j-k+l));
if(j+k-l < m && i+l < n) ask.emplace_back(Hash(i+l, j+k-l));
}
if(!ssize(ask)) continue;
int a = add_or(ask);
ask = vv<int>(1, Hash(i, j));
int b = add_or(ask);
queries.emplace_back(add_and({a, b}));
}
}
add_or(queries);
}
#ifdef LOCAL
signed main(){
int T = 1;
for(++T; --T; ){
construct_network(1, 1, 1);
}
return 0;
}
#endif
