#include <bits/stdc++.h>
using namespace std;
const int N = 5005;

inline int read() {
	char ch = getchar(); int x = 0;
	while (!isdigit(ch)) {ch = getchar();};
	while (isdigit(ch)) {x = x * 10 + ch - 48; ch = getchar();}
	return x;
}

int a[N][N], b[N][N];

void gen(int n, int seed) {
	mt19937 rnd(seed);
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= n + 1; ++j)
			b[i][j] = read();
		for (int j = 1; j <= n + 1; ++j) a[i][b[i][j]] = j;
	}
}

int n, seed, pos[N], id[N], sum, now;
bool vis[N];

int main() {
	n = read(); seed = read();
	if (seed) gen(n, seed);
	else {
		for (int i = 1; i <= n; ++i)
			for (int j = 1; j <= n + 1; ++j)
				b[i][j] = read(), a[i][b[i][j]] = j;
	}
	sum = (n + 1) * (n + 2) / 2;
	for (int i = n; i >= 1; --i) {
		int j = 1;
		while (vis[a[i][j]]) j++;
		pos[a[i][j]] = i; id[i] = a[i][j];
		vis[a[i][j]] = true;
		now += a[i][j];
	}
	printf("%d ", sum - now);
	for (int p = 2; p <= n; ++p) {
		int x = p - 1, v = a[x][1];
		pos[id[x]] = 0; now -= id[x]; vis[id[x]] = false;
		while (true) {
			if (pos[v] == 0) {
				vis[v] = true;
				pos[v] = x; id[x] = v;
				now += v;
				break;
			}else {
				int y = pos[v];
				id[x] = v;
				pos[v] = x;
				x = y; v = b[x][v];
				while (vis[a[x][v]]) v++;
				v = a[x][v];
			}
		}
		printf("%d ", sum - now);
	}
	return 0;
}