#include <bits/stdc++.h>
#include "vision.h"
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma GCC target("popcnt")
#define endl '\n'
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fo(i,n) for(auto i =0 ; i < n;i++)
#define fore(i,l,r) for(auto i = l; i < r;i++)
#define forex(i,r,l) for(auto i = r; i >= l; i--)
#define ffo(i,n) forex(i,n-1,0)
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define sz(x) (int)x.size()
#define gcd(a,b) __gcd(a,b)
#define vii vector<ii>
#define pq_min(a) priority_queue<a, vector<a>, greater<a>>
#define fls cout.flush()
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using ii = pair<int,int>;
using mii = map<int,int>;
using lld = long double;
void valid(ll in){cout<<((in)?"YES\n":"NO\n");}
/*
std::vector<int> Ns;
Ns = {0, 1};
int a = add_and(Ns);
Ns = {0, a};
int b = add_or(Ns);
Ns = {0, 1, b};
int c = add_xor(Ns);
add_not(c);
*/
void construct_network(int n,int m, int k){
int c=n*m;
ffo(c1,m){
vi d;
int i=0,j=c1;
while(i<n&&j<m){
d.pb(i*m+j);
i++;j++;
}
add_or(d);
c++;
}
fo(r1,n){
vi d;
int i=r1,j=0;
while(i<n&&j<m){
d.pb(i*m+j);
i++;j++;
}
add_or(d);
c++;
}
vi resp;
int fija = c;
fore(i, n*m, fija-2){
add_and({i, i+1});
resp.pb(c);
c++;
}
int ant = c;
fo(r1, n){
vi d;
int i=r1,j=0;
while(i>=0&&j<m){
d.pb(i*m+j);
i--;j++;
}
add_or(d);
c++;
}
fo(c1, n){
vi d;
int i=n-1,j=c1;
while(i>=0&&j<m){
d.pb(i*m+j);
i--;j++;
}
add_or(d);
c++;
}
int fija2 = c;
fore(i,ant, fija2-2){
add_and({i, i+1});
resp.pb(c);
c++;
}
add_or(resp);
}
