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
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
#include <iostream>


using namespace std;

using lli = long long int;


struct Neighbour
{
	int x, y;
};


struct Color
{
	int x, y;

	Neighbour aNbrs[3];
};


static int n, k, iL, iR, iTwoN;

static lli aResultK[12] = { 0, };

static lli aCurrK[12];

static int aBelt[2][100000];

static Color aColors[200000];


struct SetElem
{
	int m_iParent;
	int m_iCycle;
	int m_iRank;
};


class Forrest
{
	int m_iSetCount;
	int m_iCurrCycle;

	SetElem m_aElems[200002];

	void DoLink(int iColor0, int iColor1)
	{
		m_iSetCount--;

		if (m_aElems[iColor0].m_iRank > m_aElems[iColor1].m_iRank)
		{
			m_aElems[iColor1].m_iParent = iColor0;
		}
		else
		{
			m_aElems[iColor0].m_iParent = iColor1;

			if (m_aElems[iColor0].m_iRank == m_aElems[iColor1].m_iRank)
			{
				m_aElems[iColor1].m_iRank++;
			}
		}
	}

public:
	void Init()
	{
		m_iCurrCycle = 1;
		m_iSetCount = 0;

		for (int i = 1; i <= iTwoN; ++i)
		{
			m_aElems[i].m_iCycle = 0;
		}
	}

	void AddSet(int iColor)
	{
		m_aElems[iColor].m_iParent = iColor;
		m_aElems[iColor].m_iCycle = m_iCurrCycle;
		m_aElems[iColor].m_iRank = 0;

		m_iSetCount++;
	}

	void Switch2NextCycle()
	{
		m_iCurrCycle++;
		m_iSetCount = 0;
	}

	int FindSet(int iColor)
	{
		if (m_aElems[iColor].m_iCycle != m_iCurrCycle)
		{
			return -1;
		}

		int i = iColor;

		while (m_aElems[i].m_iParent != i)
		{
			i = m_aElems[i].m_iParent;
		}

		int iRoot = i;

		i = iColor;

		while (m_aElems[i].m_iParent != i)
		{
			int iNext = m_aElems[i].m_iParent;

			m_aElems[i].m_iParent = iRoot;

			i = iNext;
		}

		return iRoot;
	}

	void MakeUnion(int iColor0, int iColor1)
	{
		int iSet0 = FindSet(iColor0);

		if (iSet0 == -1)
			return;

		int iSet1 = FindSet(iColor1);

		if (iSet1 == -1)
			return;

		if (iSet0 == iSet1)
			return;

		DoLink(iSet0, iSet1);
	}

	bool AreInTheSameComponent(int iColor0, int iColor1)
	{
		int iSet0 = FindSet(iColor0);

		if (iSet0 == -1)
			return false;

		int iSet1 = FindSet(iColor1);

		if (iSet1 == -1)
			return false;

		return iSet0 == iSet1;
	}

	int GetNumberOfSets()
	{
		return m_iSetCount;
	}
};


static Forrest forrest;


static void ReadData()
{
	int iColor;

	cin >> n >> k;

	for (int i = 0; i < 2; ++i)
	{
		for (int j = 0; j < n; ++j)
		{
			cin >> iColor;

			aBelt[i][j] = iColor;

			Color& c = aColors[iColor];

			c.x = j;
			c.y = i;

			c.aNbrs[0].x = c.x;
			c.aNbrs[0].y = 1 - c.y;

			c.aNbrs[1].x = c.x + 1;
			c.aNbrs[1].y = c.y;

			if (c.aNbrs[1].x == n)
				c.aNbrs[1].x = 0;

			c.aNbrs[2].x = c.x - 1;
			c.aNbrs[2].y = c.y;

			if (c.aNbrs[2].x == -1)
				c.aNbrs[2].x = n - 1;
		}
	}
}


static void Init()
{
	iTwoN = n * 2;

	forrest.Init();
}


static int StartGrowingNewSegmentFamily(int iNewL)
{
	for (int i = 1; i <= k; ++i)
	{
		aCurrK[i] = 0;
	}

	forrest.Switch2NextCycle();
	forrest.AddSet(iNewL);

	iL = iNewL;
	iR = iNewL;

	aCurrK[1] = 1;

	while (iR < iTwoN)
	{
		forrest.AddSet(++iR);

		// for each neighbour of iR:
		//     if it is in one of our sets
		//         then merge respective sets

		Color& c = aColors[iR];

		for (int i = 0; i < 3; ++i)
		{
			Neighbour& nb = c.aNbrs[i];

			int iNbrColor = aBelt[nb.y][nb.x];

			if (forrest.FindSet(iNbrColor) != -1)
			{
				forrest.MakeUnion(iR, iNbrColor);
			}
		}

		int iNumOfSets = forrest.GetNumberOfSets();

		if (iNumOfSets <= k)
		{
			aCurrK[iNumOfSets]++;
		}
	}

	for (int i = 1; i <= k; ++i)
	{
		aResultK[i] += aCurrK[i];
	}

	return iNewL + 1;
}


static void Solve()
{
	for (int iNewL = 1; iNewL <= iTwoN; )
	{
		iNewL = StartGrowingNewSegmentFamily(iNewL);
	}
}


static void Output()
{
	for (int i = 1; i <= k; ++i)
	{
		if (i != 1)
			cout << " ";

		cout << aResultK[i];
	}
}


int main()
{
	ReadData();
	Init();
	Solve();
	Output();
}