#include "vision.h"
//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef int ll;
ll h , w , k , q, dp[105][100005], a[555555] , b[555555], l, m, n, o, p;
map < ll , ll > mp;
vll o1[555555] , o2[555555];
const ll mod = 1e9+7;
str s;
void construct_network(int H, int W, int K) {
for(ll i = 0 ; i < H ; i++){
for(ll j = 0 ; j < W ; j++){
o1[i].pb(i * W + j) ;
}
}
for(ll j = 0 ; j < W ; j++){
for(ll i = 0 ; i < H ; i++){
o2[j].pb(i * W + j) ;
}
}
vll Or , Xor ;
for(ll i = 0 ; i < H ; i++){
Or.pb(add_or(o1[i])) ;
Xor.pb(add_xor(o1[i])) ;
}
for(ll i = 0 ; i < W ; i++){
Or.pb(add_or(o2[i])) ;
Xor.pb(add_xor(o2[i])) ;
}
vll Not ;
for(auto u : Xor){
Not.pb(add_not(u)) ;
}
vll And , Op ;
for(ll i = 0 ; i < sz(Not) ; i++){
And.pb(add_and(vll{Not[i] , Or[i]})) ;
if(i == H - 1 || i == sz(Not) - 1)C ;
Op.pb(add_and(vll{Or[i + 1] , Or[i]})) ;
}
ll p1 = add_or(And) , p2 = add_or(Op) ;
add_and(vll{p1 , p2}) ;
}
