#!/usr/bin/env python3

def dist(a, b):
  if a is b:
    return 0
  res = 0
  for i in range(len(a)):
    res += abs(a[i]-b[i])
  return res

n,l,k = map(int, input().split())
names = []
values = []
for i in range(n):
  name, *vals = input().split()
  names += [name]
  values += [list(map(int, vals))]

used = set()
worst = [dist(values[0], values[i]) for i in range(n)]

for i in range(k):
  best = (-1,-1)
  for j in range(n):
    if j not in used:
      if worst[j] > best[0]:
        best = (worst[j],j)
  for j in range(n):
    q = dist(values[best[1]], values[j])
    if i == 0 or q < worst[j]:
      worst[j] = q
  used.add(best[1])
  print(names[best[1]])