//by szh
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}
#include "vision.h"
void construct_network(int H, int W, int K) {
int cnt = -1;
vector <int> q;
rep(i,0,H)
rep(j,0,W) {
vector <int> tmp;
rep(k,0,K+1) {
if (i+k<H and j+(K-k)<W) tmp.pb((i+k)*W+j+(K-k));
if (i+k<H and j-(K-k)>=0) tmp.pb((i+k)*W+j-(K-k));
}
if (!tmp.empty()) {
cnt++;
add_or(tmp);
add_and({i*W+j,H*W+cnt});
cnt++;
q.pb(H*W+cnt);
}
}
add_or(q);
}
