#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <bitset>
#include <cstring>
#include <unordered_map>
#include "vision.h"
using namespace std;
typedef int ll;
/*
int add_and(std::vector<int> Ns);
int add_or(std::vector<int> Ns);
int add_xor(std::vector<int> Ns);
int add_not(int N);
*/
vector<ll> vec(deque<ll> d){
vector<ll> v;
for(auto i: d)
v.push_back(i);
return v;
}
void add_zero(ll n, ll m, deque<ll> &d, ll &cur){
vector<ll> all = {};
for(int i = 0; i < n; i++)
for(int j = 0; j < m; j++)
all.push_back({i * m + j});
add_xor(all);
d.push_front(cur++);
}
void add_one(ll n, ll m, deque<ll> &d, ll &cur){
vector<ll> all = {};
for(int i = 0; i < n; i++)
for(int j = 0; j < m; j++)
all.push_back({i * m + j});
add_xor(all);
cur++;
add_not(cur - 1);
d.push_front(cur++);
}
void construct_network(int n, int m, int k){
if(n == 1){
vector<ll> row, col;
for(int i = n * m; i < n * m + n; i++)
row.push_back(i);
for(int i = n * m + n; i < n * m + n + m; i++)
col.push_back(i);
for(int i = 0; i < n; i++){
vector<ll> h;
for(int j = 0; j < m; j++)
h.push_back(i * m + j);
add_or(h);
}
for(int j = 0; j < m; j++){
vector<ll> h;
for(int i = 0; i < n; i++)
h.push_back(i * m + j);
add_or(h);
}
ll cur = n * m + n + m;
deque<ll> inds;
for(int j = 0; j + k < m; j++){
add_and({col[j], col[j + k]});
inds.push_back(cur++);
}
if(inds.empty())
add_zero(n, m, inds, cur);
add_or(vec(inds));
}
else{
vector<ll> row, col;
for(int i = n * m; i < n * m + n; i++)
row.push_back(i);
for(int i = n * m + n; i < n * m + n + m; i++)
col.push_back(i);
for(int i = 0; i < n; i++){
vector<ll> h;
for(int j = 0; j < m; j++)
h.push_back(i * m + j);
add_or(h);
}
for(int j = 0; j < m; j++){
vector<ll> h;
for(int i = 0; i < n; i++)
h.push_back(i * m + j);
add_or(h);
}
ll cur = n * m + n + m;
deque<ll> inds;
for(int j = 0; j + k < n; j++){
add_and({row[j], row[j + k]});
inds.push_back(cur++);
}
if(inds.empty())
add_zero(n, m, inds, cur);
add_or(vec(inds));
}
}
/*
1 2 2
0 0 0 1
*/
