#include <iostream>
#include <vector>
#include <fstream>
using namespace std;

vector<string> CategorySort(vector<string>& a, int index) //index == category(razryad)
{
    vector <vector <string>> alphabet(26); //26 letters in alphabet
    vector<string> res;

    for (int i = 0; i < a.size(); ++i)
        alphabet[a[i][index] - 'a'].push_back(a[i]);//a[i] == string, index == razryad of a[i]

    for (int i = 0; i < alphabet.size(); ++i)
        for (int j = 0; j < alphabet[i].size(); ++j)
            res.push_back(alphabet[i][j]);

    return res;
}

vector<string> radixSort(vector<string>& a, int m, int k)
{
    while (m > 0 && k > 0)
    {
        a = CategorySort(a, m - 1);
        --m, --k;
    }
    return a;
}

int main()
{
    ifstream fin("radixsort.in");
    ofstream fout("radixsort.out");
    int n, m, k;
    fin >> n >> m >> k; //n - array`s size, m - string`s length, k - requests
    vector<string> a(n);

    for (int i = 0; i < n; ++i)
        fin >> a[i];

    vector<string> res = radixSort(a, m, k);

    for (int i = 0; i < res.size(); ++i)
        fout << res[i] << endl;
}