#include <bits/stdc++.h>
#ifdef LOCAL
#include "cp_debug.h"
#else
#define debug(...) 42
#endif
#define rep(i,a,b) for(int i = a; i < b; ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;

template<typename T> void read(T &x){
    x = 0;char ch = getchar();ll f = 1;
    while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
    while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
template<typename T, typename... Args> void read(T &first, Args& ... args) {
    read(first);
    read(args...);
}
template<typename T> void write(T x) {
    if(x > 9) write(x/10);
    putchar(x%10 + '0');
}

vi Z(string S) {
    vi z(sz(S));
    int l = -1, r = -1;
    rep(i,1,sz(S)) {
        z[i] = i >= r ? 0 : min(r - i, z[i - l]);
        while (i + z[i] < sz(S) && S[i + z[i]] == S[z[i]])
            z[i]++;
        if (i + z[i] > r)
            l = i, r = i + z[i];
    }
    return z;
}


const int N = 1000030;
char buf[N];
signed main() {
    int n, num_seqs;
    read(n, num_seqs);
    vector<string> vs;
    vector<pair<vi,int>> vec;
    rep(i,0,num_seqs) {
        scanf("%s", buf);
        string s(buf);
        vs.push_back(s);
        auto z = Z(s);
        vi score;
        int num = min(sz(s), n-sz(s)+1);
        rep(j,sz(s)+1-num,sz(s)+1) {
            if(z[sz(s)-j] == j) {
                score.push_back(j);
            }
        }
        reverse(all(score));
        debug(i,z,score,num);
        vec.emplace_back(score, i);
    }
    debug(vec);
    sort(all(vec));
    for(const auto& [val, pos]: vec) {
        cout << vs[pos] << '\n';
    }
    return 0;
}