#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <random>

typedef long long ll;
typedef double lf;
typedef __int128 LL;

namespace FastIO
{
    const int MAXSIZE = 1 << 20;
    char buf[MAXSIZE], *p1, *p2;
    #define gc (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) ((x) == ' ' || (x) == '\n' || (x) == '\r' || (x) == '\t')
    template <typename T> void Read(T &x)
    {
        x = 0; char ch = gc; bool f = 0;
        while (ch < '0' || ch > '9') {if (ch == '-') f = 1; ch = gc;}
        while (ch >= '0' && ch <= '9') x = x * 10 + (ch ^ 48), ch = gc;
        if (f) x = -x;
    }
    void Read(char *s)
    {
        char ch = gc;
        while (blank(ch)) ch = gc;
        while (!blank(ch)) *s++ = ch, ch = gc;
        *s = 0;
    }
}

using namespace std;
using FastIO::Read;

const int MAXN = 2e6 + 10;

mt19937 Rand(1304125);

int n, d;
int to[MAXN], id[MAXN], ml[MAXN], mr[MAXN];
int st[MAXN], top;
bool vis[MAXN];

int main()
{
    ios::sync_with_stdio(0), cin.tie(0);
    Read(n), Read(d);
    for (int i = 0; i < n * d; i++) Read(to[i]), to[i]--;
    for (int i = 0; i < n; i++) id[i] = i, mr[i] = -1;
    shuffle(id, id + n, Rand);
    for (int i = 0; i < n; i++)
    {
        top = 0;
        int x = id[i];
        while (~x)
        {
            int y = to[x * d + Rand() % d];
            while (mr[y] == x) y = to[x * d + Rand() % d];
            while (vis[y]) vis[st[top--]] = 0;
            x = mr[y], vis[st[++top] = y] = 1;
        }
        x = id[i];
        for (int j = 1; j <= top; j++) vis[st[j]] = 0, swap(x, mr[st[j]]);
    }
    for (int i = 0; i < n; i++) ml[mr[i]] = i;
    for (int i = 0; i < n; i++) cout << ml[i] + 1 << ' ';
    return 0;
}