#!/usr/bin/python3
import sys

N,K,M = map(int, input().split())

grps = {}

for line in sys.stdin:
    line = line.rstrip('\n')
    assert len(line) >= K
    assert not (line[0].isspace() or line[-1].isspace())
    suffix = line[-K:]
    grps.setdefault(suffix, []).append(line)

lst = sorted(grps.items(), key=lambda x: -len(x[1]))

m2 = M//2
m1 = M - m2

if len(lst) >= 2 and len(lst[0][1]) >= m1 and len(lst[1][1]) >= m2:
    g1 = lst[0][1][:m1]
    g2 = lst[1][1][:m2]
elif len(lst) >= 1 and len(lst[0][1] >= m1 + m2):
    g1 = lst[0][1][:m1]
    g2 = lst[0][1][m1:m1+m2]
else:
    print("NEEXISTUJE")
    sys.exit(0)


for i in range(M):
    if i % 2 == 0:
        print(g1[i//2])
    else:
        print(g2[(i-1)//2])