1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
#define FR first
#define SD second
#define PB push_back
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__) // debugging /*
template <typename T> struct tag:reference_wrapper <T>{ using reference_wrapper <T>::reference_wrapper; };
template <typename T1, typename T2> static inline tag <ostream> operator<<(tag <ostream> os, pair<T1, T2> const& p){ return os.get()<<"{"<<p.first<<", "<<p.second<<"}", os;}
template <typename Other> static inline tag <ostream> operator<<(tag <ostream> os, Other const& o){ os.get()<<o; return os; }
template <typename T> static inline tag <ostream> operator <<(tag <ostream> os, vector <T> const& v){ os.get()<<"["; for (int i=0; i<v.size(); i++) if (i!=v.size()-1) os.get()<<v[i]<<", "; else os.get()<<v[i]; return os.get()<<"]", os; }
template <typename T> static inline tag <ostream> operator <<(tag <ostream> os, set <T> const& s){ vector <T> v; for (auto i: s) v.push_back(i); os.get()<<"["; for (int i=0; i<v.size(); i++) if (i!=v.size()-1) os.get()<<v[i]<<", "; else os.get()<<v[i]; return os.get()<<"]", os; }
template <typename ...Args> void logger(string vars, Args&&... values) { cout<<"[ "<<vars<<" = "; string delim=""; (..., (cout<<delim<<values, delim=", ")); cout <<" ]\n"; }
/**/

constexpr int MxN = 1e5+5;
int tab[3][MxN];
ll zlicz[11];
bool vis[2*MxN];
int n, k;

void dfs(int i, int j, int l, int r) {
	vis[tab[i][j]] = true;
	if (i == 1 && !vis[tab[i+1][j]] && (l <= tab[i+1][j] && tab[i+1][j] <= r))
		dfs(i+1, j, l, r);
	else if (i == 2 && !vis[tab[i-1][j]] && (l <= tab[i-1][j] && tab[i-1][j] <= r))
		dfs(i-1, j, l, r);
	int nj = (j-1 < 1 ? n : j-1);
	if (!vis[tab[i][nj]] && (l <= tab[i][nj] && tab[i][nj] <= r))
		dfs(i, nj, l, r);
	nj = (j+1 > n ? 1 : j+1);
	if (!vis[tab[i][nj]] && (l <= tab[i][nj] && tab[i][nj] <= r))
		dfs(i, nj, l, r);
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);

	cin >> n >> k;
	for (int i=1; i<=2; i++)
		for (int j=1; j<=n; j++)
			cin >> tab[i][j];
		
	for (int l=1; l<=2*n; l++)
		for (int r=l; r<=2*n; r++) {
			ll ciekawosc = 0;
			memset(vis, 0, sizeof(vis));
			for (int i=1; i<=2; i++)
				for (int j=1; j<=n; j++)
					if (!vis[tab[i][j]] && (l <= tab[i][j] && tab[i][j] <= r)) {
						ciekawosc++;
						dfs(i, j, l, r);
					}
			if (ciekawosc <= 10)
				zlicz[ciekawosc]++;
		}
	
	for (int i=1; i<=k; i++)
		cout << zlicz[i] << " ";
	cout << "\n";

	return 0;
}