#ifndef LOCAL
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#endif

#include <bits/stdc++.h>
using namespace std;

using ll=long long;
//#define int ll

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using pi=pair<int,int>;
using vi=vc<int>;

template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.a<<","<<p.b<<"}";
}

template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}

#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
#ifdef LOCAL
void dmpr(ostream&os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ";
	dmpr(os,args...);
}
#define dmp2(...) dmpr(cerr,__LINE__,##__VA_ARGS__)
#else
#define dmp2(...) void(0)
#endif

using uint=unsigned;
using ull=unsigned long long;

template<class t,size_t n>
ostream& operator<<(ostream&os,const array<t,n>&a){
	return os<<vc<t>(all(a));
}

template<int i,class T>
void print_tuple(ostream&,const T&){
}

template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
	if(i)os<<",";
	os<<get<i>(t);
	print_tuple<i+1,T,Args...>(os,t);
}

template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
	os<<"{";
	print_tuple<0,tuple<Args...>,Args...>(os,t);
	return os<<"}";
}

ll read(){
	ll i;
	cin>>i;
	return i;
}

vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=read()+off;
	return v;
}

pi readpi(int off=0){
	int a,b;cin>>a>>b;
	return pi(a+off,b+off);
}

template<class t>
void print_single(t x,int suc=1){
	cout<<x;
	if(suc==1)
		cout<<"\n";
	if(suc==2)
		cout<<" ";
}

template<class t,class u>
void print_single(const pair<t,u>&p,int suc=1){
	print_single(p.a,2);
	print_single(p.b,suc);
}

template<class T>
void print_single(const vector<T>&v,int suc=1){
	rep(i,v.size())
		print_single(v[i],i==int(v.size())-1?suc:2);
}

template<class T>
void print_offset(const vector<T>&v,ll off,int suc=1){
	rep(i,v.size())
		print_single(v[i]+off,i==int(v.size())-1?suc:2);
}

template<class T,size_t N>
void print_single(const array<T,N>&v,int suc=1){
	rep(i,N)
		print_single(v[i],i==int(N)-1?suc:2);
}

template<class T>
void print(const T&t){
	print_single(t);
}

template<class T,class ...Args>
void print(const T&t,const Args&...args){
	print_single(t,2);
	print(args...);
}

string readString(){
	string s;
	cin>>s;
	return s;
}

template<class T>
T sq(const T& t){
	return t*t;
}

void YES(bool ex=true){
	cout<<"YES\n";
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void NO(bool ex=true){
	cout<<"NO\n";
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void Yes(bool ex=true){
	cout<<"Yes\n";
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void No(bool ex=true){
	cout<<"No\n";
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
//#define CAPITAL
/*
void yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<"\n";
	#else
	cout<<"Yes"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void no(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<"\n";
	#else
	cout<<"No"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}*/
void possible(bool ex=true){
	#ifdef CAPITAL
	cout<<"POSSIBLE"<<"\n";
	#else
	cout<<"Possible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void impossible(bool ex=true){
	#ifdef CAPITAL
	cout<<"IMPOSSIBLE"<<"\n";
	#else
	cout<<"Impossible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}

constexpr ll ten(int n){
	return n==0?1:ten(n-1)*10;
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

int topbit(signed t){
	return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
	return t==0?-1:63-__builtin_clzll(t);
}
int topbit(ull t){
	return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
	return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
	return a==0?64:__builtin_ctzll(a);
}
int botbit(ull a){
	return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
	return __builtin_popcount(t);
}
int popcount(ll t){
	return __builtin_popcountll(t);
}
int popcount(ull t){
	return __builtin_popcountll(t);
}
int bitparity(ll t){
	return __builtin_parityll(t);
}
bool ispow2(int i){
	return i&&(i&-i)==i;
}
ll mask(int i){
	return (ll(1)<<i)-1;
}
ull umask(int i){
	return (ull(1)<<i)-1;
}
ll minp2(ll n){
	if(n<=1)return 1;
	else return ll(1)<<(topbit(n-1)+1);
}

bool inc(int a,int b,int c){
	return a<=b&&b<=c;
}

template<class t> void mkuni(vc<t>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.ed);
}

ll rand_int(ll l, ll r) { //[l, r]
	//#ifdef LOCAL
	static mt19937_64 gen;
	/*#else
	static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
	#endif*/
	return uniform_int_distribution<ll>(l, r)(gen);
}

ll rand_int(ll k){ //[0,k)
	return rand_int(0,k-1);
}

template<class t>
void myshuffle(vc<t>&a){
	rep(i,si(a))swap(a[i],a[rand_int(0,i)]);
}

template<class t,class u>
int lwb(const vc<t>&v,const u&a){
	return lower_bound(all(v),a)-v.bg;
}
template<class t,class u>
bool bis(const vc<t>&v,const u&a){
	return binary_search(all(v),a);
}

vvc<int> readGraph(int n,int m){
	vvc<int> g(n);
	rep(i,m){
		int a,b;
		cin>>a>>b;
		//sc.read(a,b);
		a--;b--;
		g[a].pb(b);
		g[b].pb(a);
	}
	return g;
}

vvc<int> readTree(int n){
	return readGraph(n,n-1);
}

template<class t>
vc<t> presum(const vc<t>&a){
	vc<t> s(si(a)+1);
	rep(i,si(a))s[i+1]=s[i]+a[i];
	return s;
}
vc<ll> presum(const vi&a){
	vc<ll> s(si(a)+1);
	rep(i,si(a))s[i+1]=s[i]+a[i];
	return s;
}
//BIT で数列を管理するときに使う (CF850C)
template<class t>
vc<t> predif(vc<t> a){
	gnr(i,1,si(a))a[i]-=a[i-1];
	return a;
}
template<class t>
vvc<ll> imos(const vvc<t>&a){
	int n=si(a),m=si(a[0]);
	vvc<ll> b(n+1,vc<ll>(m+1));
	rep(i,n)rep(j,m)
		b[i+1][j+1]=b[i+1][j]+b[i][j+1]-b[i][j]+a[i][j];
	return b;
}

//verify してないや
void transvvc(int&n,int&m){
	swap(n,m);
}
template<class t,class... Args>
void transvvc(int&n,int&m,vvc<t>&a,Args&...args){
	assert(si(a)==n);
	vvc<t> b(m,vi(n));
	rep(i,n){
		assert(si(a[i])==m);
		rep(j,m)b[j][i]=a[i][j];
	}
	a.swap(b);
	transvvc(n,m,args...);
}
//CF854E
void rotvvc(int&n,int&m){
	swap(n,m);
}
template<class t,class... Args>
void rotvvc(int&n,int&m,vvc<t>&a,Args&...args){
	assert(si(a)==n);
	vvc<t> b(m,vi(n));
	rep(i,n){
		assert(si(a[i])==m);
		rep(j,m)b[m-1-j][i]=a[i][j];
	}
	a.swap(b);
	rotvvc(n,m,args...);
}

//ソートして i 番目が idx[i]
//CF850C
template<class t>
vi sortidx(const vc<t>&a){
	int n=si(a);
	vi idx(n);iota(all(idx),0);
	sort(all(idx),[&](int i,int j){return a[i]<a[j];});
	return idx;
}
//vs[i]=a[idx[i]]
//例えば sortidx で得た idx を使えば単にソート列になって返ってくる
//CF850C
template<class t>
vc<t> a_idx(const vc<t>&a,const vi&idx){
	int n=si(a);
	assert(si(idx)==n);
	vc<t> vs(n);
	rep(i,n)vs[i]=a[idx[i]];
	return vs;
}
//CF850C
vi invperm(const vi&p){
	int n=si(p);
	vi q(n);
	rep(i,n)q[p[i]]=i;
	return q;
}

template<class t,class s=t>
s SUM(const vc<t>&a){
	return accumulate(all(a),s(0));
}
template<class t,size_t K,class s=t>
s SUM(const array<t,K>&a){
	return accumulate(all(a),s(0));
}

template<class t>
t MAX(const vc<t>&a){
	return *max_element(all(a));
}

template<class t>
pair<t,int> MAXi(const vc<t>&a){
	auto itr=max_element(all(a));
	return mp(*itr,itr-a.bg);
}

template<class A>
auto MIN(const A&a){
	return *min_element(all(a));
}

template<class t>
pair<t,int> MINi(const vc<t>&a){
	auto itr=min_element(all(a));
	return mp(*itr,itr-a.bg);
}

vi vid(int n){
	vi res(n);iota(all(res),0);
	return res;
}

template<class S>
void soin(S&s){
	sort(all(s));
}

template<class S,class F>
void soin(S&s,F&&f){
	sort(all(s),forward<F>(f));
}

template<class S>
S soout(S s){
	soin(s);
	return s;
}

template<class S>
void rein(S&s){
	reverse(all(s));
}

template<class S>
S reout(S s){
	rein(s);
	return s;
}

template<class t,class u>
pair<t,u>&operator+=(pair<t,u>&a,pair<t,u> b){
	a.a+=b.a;a.b+=b.b;return a;}
template<class t,class u>
pair<t,u>&operator-=(pair<t,u>&a,pair<t,u> b){
	a.a-=b.a;a.b-=b.b;return a;}
template<class t,class u>
pair<t,u> operator+(pair<t,u> a,pair<t,u> b){return mp(a.a+b.a,a.b+b.b);}
template<class t,class u>
pair<t,u> operator-(pair<t,u> a,pair<t,u> b){return mp(a.a-b.a,a.b-b.b);}
template<class t,class u>
istream&operator>>(istream&is,pair<t,u>&a){
	return is>>a.a>>a.b;
}

template<class t>
t gpp(vc<t>&vs){
	assert(si(vs));
	t res=move(vs.back());
	vs.pop_back();
	return res;
}

template<class t,class u>
void pb(vc<t>&a,const vc<u>&b){
	a.insert(a.ed,all(b));
}

template<class t,class...Args>
vc<t> cat(vc<t> a,Args&&...b){
	(pb(a,forward<Args>(b)),...);
	return a;
}

template<class t,class u>
vc<t>& operator+=(vc<t>&a,u x){
	for(auto&v:a)v+=x;
	return a;
}

template<class t,class u>
vc<t> operator+(vc<t> a,u x){
	return a+=x;
}

template<class t>
vc<t> operator+(const vc<t>&a,const vc<t>&b){
	vc<t> c(max(si(a),si(b)));
	rep(i,si(a))c[i]+=a[i];
	rep(i,si(b))c[i]+=b[i];
	return c;
}

template<class t,class u>
vc<t>& operator-=(vc<t>&a,u x){
	for(auto&v:a)v-=x;
	return a;
}

template<class t,class u>
vc<t>& operator-(vc<t> a,u x){
	return a-=x;
}

template<class t,class u>
void remval(vc<t>&a,const u&v){
	a.erase(remove(all(a),v),a.ed);
}
//消した要素の個数を返してくれる
//UCUP 2-8-F
template<class t,class F>
int remif(vc<t>&a,F f){
	auto itr=remove_if(all(a),f);
	int res=a.ed-itr;
	a.erase(itr,a.ed);
	return res;
}

template<class VS,class u>
void fila(VS&vs,const u&a){
	fill(all(vs),a);
}

template<class t,class u>
int findid(const vc<t>&vs,const u&a){
	auto itr=find(all(vs),a);
	if(itr==vs.ed)return -1;
	else return itr-vs.bg;
}

template<class t>
void rtt(vc<t>&vs,int i){
	rotate(vs.bg,vs.bg+i,vs.ed);
}

//連結成分と頂点を一緒くたにした場合の木が tr で得られる
//連結成分たくさんとか多重辺ありとかでも動くはずだが，未確認
//連結成分 x の頂点リスト -> tr[n+x]
//孤立点は連結成分として処理されない
//s に biconnected components の個数が入る
//es にその biconnected componenents の辺のリストが入る
//辺の端点はもともとのグラフの頂点番号を使う
//VERIFY
//Petrozavodsk Camp 2020S Day2 C
//TCO2020 Wildcard Hard
//CF CodeTON Round I
template<class E>
struct articulation{
	const int n;
	const vvc<E>&g;
	vi vis,ord,low;
	int head,s;
	vvc<int> tr;
	vvc<pi> es;
	void ae(int a,int b){
		if(a==-1||b==-1)return;
		tr[a].pb(b);
		tr[b].pb(a);
	}
	void dfs(int v){
		assert(vis[v]==0);
		vis[v]=1;
		ord[v]=low[v]=head++;
		for(auto to:g[v]){
			if(vis[to]==0){
				dfs(to);
				chmin(low[v],low[to]);
			}else{
				chmin(low[v],ord[to]);
			}
		}
	}
	void dfs2(int v,int z){
		assert(vis[v]==1);
		vis[v]=2;
		ae(v,z);
		for(auto to:g[v])if(vis[to]==1){
			if(low[to]<ord[v]){
				dfs2(to,z);
			}else{
				int w=si(tr);
				tr.eb();
				es.eb();
				s++;
				ae(v,w);
				dfs2(to,w);
			}
		}else if(vis[to]==2){
			es[z-n].eb(v,to);
		}
		vis[v]=3;
	}
	articulation(const vvc<E>&gg):n(si(gg)),g(gg),
		vis(n,0),ord(n,-1),low(n,-1),head(0),s(0),tr(n){
		rep(i,n)if(vis[i]==0){
			dfs(i);
			dfs2(i,-1);
		}
	}
	//連結成分 i の辺情報を頂点番号を座標圧縮した上で返す
	pair<vi,vc<pi>> getg(int i){
		vi vs=tr[n+i];
		sort(all(vs));
		vc<pi> res=es[i];
		for(auto&[a,b]:res){
			a=lwb(vs,a);
			b=lwb(vs,b);
		}
		return mp(vs,res);
	}
};

bool dbg=false;

int R;

int sqR(int v){
	chmax(v,-(R+1));
	chmin(v,(R+1));
	return sq(v);
}

bool connected(pi a,pi b){
	return sqR(a.a-b.a)+sqR(a.b-b.b)<=sq(R);
}

const int K=4;
const int S=K*8;
struct N{
	int n=0,lcnt=0,ans=0;
	pi pos[S];
	vc<pi> g[S];
	int attach[S];
	void init(pi v){
		pos[0]=v;
		attach[0]=0;
		n=1;
		ans=1;
	}
	void toggle(){
		n^=1;
		ans^=1;
	}
	void ae(int a,int b,int c){
		g[a].eb(b,c);
		g[b].eb(a,c);
	}
	void copy_from(const N&x){
		n=x.n;
		lcnt=x.lcnt;
		ans=x.ans;
		rep(i,n)pos[i]=x.pos[i];
		rep(i,n){
			g[i].clear();
			g[i].insert(g[i].ed,all(x.g[i]));
		}
		rep(i,n)attach[i]=x.attach[i];
	}
	void checkdup(){
		rep(i,n){
			soin(g[i]);
			rep(j,si(g[i])-1)assert(g[i][j].a<g[i][j+1].a);
		}
	}
};

void mg(const N&l,const N&r,N&dst){
	if(l.n==0)return dst.copy_from(r);
	if(r.n==0)return dst.copy_from(l);
	
	static pi pos[S*2];
	static vc<pi> g[S*2];
	static int attach[S*2];
	int n=l.n+r.n;
	
	rep(i,l.n){
		pos[i]=l.pos[i];
		g[i].clear();
		for(auto [j,c]:l.g[i])
			g[i].eb(j,c);
		attach[i]=l.attach[i];
	}
	rep(i,r.n){
		pos[l.n+i]=r.pos[i];
		g[l.n+i].clear();
		for(auto [j,c]:r.g[i])
			g[l.n+i].eb(l.n+j,c);
		attach[l.n+i]=r.attach[i];
	}
	
	rng(i,max(l.n-(R-1),0),l.n)rng(j,l.n,min(l.n+(R-1),n)){
		if(connected(pos[i],pos[j])){
			g[i].eb(j,0);
			g[j].eb(i,0);
		}
	}
	
	static int vis[S*2],ord[S*2],low[S*2];
	int head,s;
	static vi tr[S*4];
	static int es[S*4],wei[S*4];
	auto ae=[&](int a,int b){
		if(a==-1||b==-1)return;
		tr[a].pb(b);
		tr[b].pb(a);
	};
	auto dfs=[&](auto self,int v)->void{
		assert(vis[v]==0);
		vis[v]=1;
		ord[v]=low[v]=head++;
		for(auto [to,num]:g[v]){
			if(vis[to]==0){
				self(self,to);
				chmin(low[v],low[to]);
			}else{
				chmin(low[v],ord[to]);
			}
		}
	};
	auto dfs2=[&](auto self,int v,int z)->void{
		assert(vis[v]==1);
		vis[v]=2;
		ae(v,z);
		for(auto [to,num]:g[v])if(vis[to]==1){
			if(low[to]<ord[v]){
				self(self,to,z);
			}else{
				int w=s++;
				tr[w].clear();
				es[w]=0;
				wei[w]=0;
				ae(v,w);
				self(self,to,w);
			}
		}else if(vis[to]==2){
			es[z]++;
			wei[z]+=num;
		}
		vis[v]=3;
	};
	rep(i,n)vis[i]=0;
	rep(i,n)ord[i]=-1;
	rep(i,n)low[i]=-1;
	head=0;
	s=n;
	rep(i,n)tr[i].clear();
	rep(i,n)if(vis[i]==0){
		dfs(dfs,i);
		dfs2(dfs2,i,-1);
	}
	
	dst.lcnt=l.lcnt+r.lcnt;
	
	rng(i,n,s)if(es[i]>=2){
		dst.lcnt+=wei[i];
		wei[i]=0;
	}
	
	int xmin=inf,xmax=-inf;
	rep(i,n){
		chmin(xmin,pos[i].a);
		chmax(xmax,pos[i].a);
	}
	
	static bool use[S*4];
	rep(i,s)use[i]=false;
	auto good=[&](int i){
		return i<n&&(pos[i].a<=xmin+(R-2)||xmax-(R-2)<=pos[i].a);
	};
	auto dfs3=[&](auto self,int v,int p)->bool{
		use[v]=good(v);
		for(auto to:tr[v])if(to!=p)
			use[v]|=self(self,to,v);
		return use[v];
	};
	rep(i,n)if(!use[i]&&good(i)){
		dfs3(dfs3,i,-1);
	}
	dst.ans=dst.lcnt;
	rep(i,n)if(si(tr[i])+attach[i]<=1&&!use[i])dst.lcnt++;
	rep(i,n)if(si(tr[i])+attach[i]<=1)dst.ans++;
	
	rep(i,s)if(use[i]){
		int c=remif(tr[i],[&](int v){return !use[v];});
		if(i<n){
			attach[i]+=c;
		}
	}
	static bool alive[S*2];
	rep(i,n)alive[i]=use[i]&&(good(i)||si(tr[i])>=3);
	rng(i,n,s)if(use[i]&&si(tr[i])>=3){
		for(auto j:tr[i])alive[j]=true;
	}
	
	static int idx[S*2];
	dst.n=0;
	rep(i,n)if(alive[i]){
		int j=dst.n++;
		idx[i]=j;
		dst.pos[j]=pos[i];
		dst.g[j].clear();
		dst.attach[j]=attach[i];
	}else{
		idx[i]=-1;
	}
	rng(i,n,s)if(use[i]&&si(tr[i])>=3){
		int pre=tr[i].back();
		for(auto j:tr[i]){
			assert(alive[pre]);
			assert(alive[j]);
			dst.ae(idx[pre],idx[j],0);
			pre=j;
		}
	}
	auto getnext=[&](int u,int v){
		if(tr[v][0]==u)return tr[v][1];
		else return tr[v][0];
	};
	rep(i,n)if(alive[i]){
		for(auto to:tr[i])if(si(tr[to])==2){
			int u=i,v=to,sum=0;
			while(1){
				if(v<n){
					if(alive[v])break;
					sum+=(attach[v]==0);
				}else{
					sum+=wei[v];
				}
				assert(si(tr[v])==2);
				int nx=getnext(u,v);
				u=v;
				v=nx;
			}
			assert(alive[i]);
			assert(alive[v]);
			if(idx[i]<idx[v])dst.ae(idx[i],idx[v],sum);
		}
	}
}

const int vmax=20;
const int nqmax=15;
const int Rmax=5;
vi getvals(int n){
	set<int> s;
	while(si(s)<n){
		s.insert(rand_int(0,vmax));
	}
	vi res(all(s));
	myshuffle(res);
	return res;
}

void slv(){
	int n;
	if(!dbg){
		cin>>n;
		if(n<0)dbg=true;
	}
	if(dbg){
		n=rand_int(1,nqmax);
	}
	
	if(dbg){
		R=rand_int(2,Rmax);
	}else{
		cin>>R;
	}
	
	vc<pi> raw(n);
	if(dbg){
		vi xs=getvals(n);
		vi ys=getvals(n);
		rep(i,n)raw[i]=pi(xs[i],ys[i]);
	}else{
		rep(i,n)cin>>raw[i];
	}
	vi idx=sortidx(raw);
	vi xdi=invperm(idx);
	
	vc<bool> avail(n,true);
	
	int s=minp2(n);
	vc<N> buf(s*2);
	rep(i,n){
		buf[s+i].init(raw[idx[i]]);
	}
	
	auto upd=[&](int i){
		mg(buf[i*2],buf[i*2+1],buf[i]);
	};
	gnr(i,1,s)upd(i);
	
	int q;
	if(dbg){
		q=rand_int(1,nqmax);
	}else{
		cin>>q;
	}
	int last=0;
	rep(_,q){
		int k;
		if(dbg){
			k=rand_int(n);
		}else{
			cin>>k;
			k^=last;
			k--;
		}
		if(!inc(0,k,n-1))exit(0);
		assert(inc(0,k,n-1));
		dmp(k);
		
		if(dbg){
			avail[k]=!avail[k];
		}
		
		k=xdi[k];
		k+=s;
		buf[k].toggle();
		while(k>>=1)upd(k);
		
		print(buf[1].ans);
		last=buf[1].ans;
		
		if(dbg){
			vc<pi> ls;
			rep(i,n)if(avail[i])ls.pb(raw[i]);
			vvc<int> g(si(ls));
			rep(i,si(ls))rng(j,i+1,si(ls))if(connected(ls[i],ls[j])){
				g[i].pb(j);
				g[j].pb(i);
			}
			articulation<int> art(g);
			int god=0;
			rep(i,si(ls))if(si(art.tr[i])<=1)god++;
			
			dmp2(god,buf[1].ans);
			assert(god==buf[1].ans);
		}
	}
}

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	
	slv();
	
	if(dbg){
		while(1)slv();
	}else{
		//int t;cin>>t;rep(_,t)
	}
}