#include <bits/stdc++.h>
#include "dungeon2.h"
using namespace std;
#define pii pair<int,int>

vector<int> do_wym[203];
int known_deg[203];
vector<pii> graph[203];
vector<pii> sciezki[203][203];
int macierz[203][203];
int dp[203][203];
int wyn[203];
pii fat[203];
int deg[203];
int wolne=0;

void dfs(int v, int p){
	deg[v]=NumberOfRoads();
	do_wym[v].resize(deg[v]+1);
	if (v!=1){
		fat[v]={LastRoad(),p};
		do_wym[v][LastRoad()]=p;
		known_deg[v]++;
		graph[v].push_back({p,LastRoad()});
	}
	for (int i = 1; i<=deg[v]; i++){
		if (i==fat[v].first)continue;
		Move(i,2);
		if (Color()==2)Move(LastRoad(),2);
		else{
			do_wym[v][i]=++wolne;
			known_deg[v]++;
			graph[v].push_back({wolne,i});
			dfs(wolne,v);
		}
	}
	if (v!=1)Move(fat[v].first,2);
}

bool build_sciezka(int v, int p, int a, int b){
	if (v==b)return true;
	for (auto u : graph[v]){
		if (u.first==p)continue;
		sciezki[a][b].push_back(u);
		if (build_sciezka(u.first,v,a,b))return true;
		sciezki[a][b].pop_back();
	}
	return false;
}

void MyMove(int a, int b){
	for (auto u : sciezki[a][b]){
		Move(u.second,Color());
	}
}

void Inspect(int R){
	dfs(++wolne,0);
	int n=wolne;
	for (int i = 1; i<=n; i++){
		for (int j = 1; j<=n; j++){
			build_sciezka(i,0,i,j);
		}
	}
	int cur=1;
	for (int i = 1; i<=n; i++){
		if (known_deg[i]<deg[i]){
			MyMove(cur,i);
			cur=i;
			Move(1,3);
			Move(LastRoad(),1);
			for (int j = i+1; j<=n; j++){
				if (known_deg[j]<deg[j]){
					MyMove(cur,j);
					cur=j;
					for (int u = 1; u<=deg[cur] && known_deg[cur]<deg[cur]; u++){
						Move(u,1);
						if (Color()==3){
							known_deg[i]++;
							known_deg[j]++;
							macierz[i][j]=macierz[j][i]=1;
						}
						Move(LastRoad(),Color());
					}
				}
			}
			MyMove(cur,i);
			cur=i;
			Move(1,1);
			Move(LastRoad(),1);
		}
	}
	for (int i = 1; i<=n; i++){
		for (auto u : graph[i])macierz[i][u.first]=macierz[u.first][i]=1;
	}
	for (int i = 1; i<=n; i++){
		for (int j = 1; j<=n; j++){
			dp[i][j]=1000;
			if (i==j)dp[i][j]=0;
			if (macierz[i][j])dp[i][j]=macierz[i][j];
		}
	}
	for (int k = 1; k<=n; k++){
		for (int i = 1; i<=n; i++){
			for (int j = 1; j<=n; j++){
				dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j]);
			}
		}
	}
	for (int i = 1; i<=n; i++){
		for (int j = i+1; j<=n; j++){
			wyn[dp[i][j]]++;
		}
	}
	for (int i = 1; i<=R; i++){
		Answer(i,wyn[i]);
	}
}