#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (1e+18) + 7;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-6;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;

ll mod_pow(ll a, ll n) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%mod;
		a = a * a%mod; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

//const int max_n = 1 << 22;
//modint fact[max_n], factinv[max_n];
//void init_f() {
//	fact[0] = modint(1);
//	for (int i = 0; i < max_n - 1; i++) {
//		fact[i + 1] = fact[i] * modint(i + 1);
//	}
//	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
//	for (int i = max_n - 2; i >= 0; i--) {
//		factinv[i] = factinv[i + 1] * modint(i + 1);
//	}
//}
//modint comb(int a, int b) {
//	if (a < 0 || b < 0 || a < b)return 0;
//	return fact[a] * factinv[b] * factinv[a - b];
//}

vector<P> to[16][6];

bool used[1 << 16][16][6];
string memo[1 << 16][16][6];
void solve() {
	int n, k; cin >> n >> k;
	vector<string> s(n);
	rep(i, n) {
		cin >> s[i];
	}
	map<string, vector<P>> mp;
	vector<vector<string>> z(n);
	rep(i, n) {
		vector<bool> alf(n, false);
		for (char t : s[i]) {
			alf[t - 'A'] = true;
		}
		string v;
		rep(j, n)if (!alf[j])v.push_back('A' + j);
		string sta = s[i]; reverse(all(sta));
		int tmp = 0;
		while (true) {
			string t = sta + v;
			z[i].push_back(t);
			mp[t].push_back({ i,tmp });
			tmp++;
			if (!next_permutation(all(v)))break;
		}
	}
	rep(i, n) {
		rep(j, z[i].size()) {
			string &ori = z[i][j];
			rep(l, n) {
				if (l == i)continue;
				int tmp = 0;
				rep(x, n) {
					if (tmp < k&&ori[x] == s[l][tmp])tmp++;
				}
				if (tmp == k) {
					string nex;
					tmp = 0;
					rep(x, n) {
						if (tmp < k&&ori[x] == s[l][tmp])tmp++;
						else nex.push_back(ori[x]);
					}
					reverse(all(nex));
					nex += s[l];
					reverse(all(nex));
					//cout << i << " " << l << " " << nex << endl;
					for (P p : mp[nex]) {
						to[i][j].push_back(p);
						//cout << i << " " << j << " add " << p.first << " " << p.second << endl;
					}
				}
			}
		}
	}
	char zz = 'Z' + 1;
	string sup; sup.push_back(zz);
	function<string(int, int, int)> dfs = [&](int s, int i, int j)->string {
		if (s == (1 << n) - 1)return "";
		if (used[s][i][j])return memo[s][i][j];
		used[s][i][j] = true;
		memo[s][i][j] = sup;
		for (P p : to[i][j]) {
			int ni = p.first, nj = p.second;
			if (s&(1 << ni))continue;
			string t = dfs(s ^ (1 << ni), ni, nj);
			if (t != sup)t.insert(t.begin(), 'A' + ni);
			memo[s][i][j] = min(memo[s][i][j], t);
		}
		return memo[s][i][j];
	};
	string ans = sup;
	rep(i, n) {
		rep(j, z[i].size()) {
			string t = dfs(1 << i, i, j);
			if (t != sup)t.insert(t.begin(), 'A' + i);
			ans = min(ans, t);
		}
	}
	cout << ans << endl;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(12);
	//init_f();
	//int t; cin >> t; rep(i, t)solve();
	solve();
	stop
		return 0;
}

