#include <bits/stdc++.h>
using namespace std;

char *p1, *p2, buf[1048577];
#define gc (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++)
template <typename T>
inline void Read(T &x)
{
    x = 0; char ch = gc;
    while (!isdigit(ch)) ch = gc;
    while (isdigit(ch)) x = (x << 3) + (x << 1) + (ch ^ 48), ch = gc;
}

typedef long long ll;
const int maxn = 2e6 + 5;
const int inf = 0x3f3f3f3f;

bool vis[maxn];
int to[maxn], p[maxn], mt[maxn], ans[maxn];
mt19937 rnd(time(0) ^ *(new unsigned long long));

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n, d;
    Read(n), Read(d);
    for (int i = 0; i < n * d; i++) Read(to[i]), to[i]--;
    for (int i = 0; i < n; i++) p[i] = i, mt[i] = -1;
    shuffle(p, p + n, rnd);

    for (int i = 0; i < n; i++)
    {
        int u = p[i]; vector<int> q;
        while (~u)
        {
            int v = -1;
            do { v = to[u * d + rnd() % d]; } while (mt[v] == u);
            u = mt[v];
            if (!vis[v]) vis[v] = 1, q.emplace_back(v);
            else
            {
                while (q.back() != v) vis[q.back()] = 0, q.pop_back();
            }
        }

        u = p[i];
        for (int x : q) vis[x] = 0, swap(mt[x], u);
    }

    for (int i = 0; i < n; i++) ans[mt[i]] = i;
    for (int i = 0; i < n; i++) cout << ans[i] + 1 << " ";
    return 0;
}