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

int main() {
    int n, l, k;
    scanf("%d%d%d", &n, &l, &k);

    vector<string> s(n);
    vector<vector<int>> a(n, vector<int>(l));
    for (int i = 0; i < n; i++) {
        char buf[111];
        scanf("%s", buf);
        s[i] = buf;
        for (int j = 0; j < l; j++) {
            scanf("%d", &a[i][j]);
        }
    }

    auto dist = [&](int i, int j) {
        int sum = 0;
        for (int t = 0; t < l; t++) {
            sum += abs(a[i][t] - a[j][t]);
        }
        return sum;
    };
    int cdist = 0, ci = 0;
    for (int i = 1; i < n; i++) {
        int ndist = dist(i, 0);
        if (ndist > cdist) {
            cdist = ndist;
            ci = i;
        }
    }

    vector<string> ans;
    vector<char> used(n);
    vector<int> d(n, 1e9);
    while (ans.size() < k) {
        ans.push_back(s[ci]);
        used[ci] = 1;
        for (int i = 0; i < n; i++) {
            d[i] = min(d[i], dist(i, ci));
        }
        ci = -1;
        for (int i = 0; i < n; i++) {
            if (!used[i] && (ci == -1 || d[i] > d[ci])) {
                ci = i;
            }
        }
    }
    for (auto s : ans) printf("%s\n", s.c_str());
}