#include<iostream>
#include<map>
#include<string>
using namespace std;
int inversion(string str) {
	int count = 0;
	int len = str.length();
	for (int i = 0; i < len - 1; i++) {
		for (int j = i+1; j < len; j++) {
			if (str[i] > str[j]) count++;
		}
	}
	return count;
}

int main() {
	int m, n;
	cin >> m >> n;
	map<int, string> M;
	while (n--) {
		string str;
		cin >> str;
		M.insert(make_pair(inversion(str), str));
	}
	for (std::map<int, string>::iterator it = M.begin(); it != M.end(); it++) {
		cout << it->second << endl;
	}
	system("pause");
	return 0;
}