DNA Sorting

今天的题目如下：

DNA Sorting

Problem Description

One measure of unsortedness'' in a sequence is the number of pairs of entries that are out of order with respect to each other. For instance, in the letter sequenceDAABEC’’, this measure is 5, since D is
greater than four letters to its right and E is greater than one letter to its
right. This measure is called the number of inversions in the sequence. The
sequence AACEDGG'' has only one inversion (E and D)---it is nearly sorted---while the sequenceZWQM’’ has 6 inversions (it is as unsorted as can
be—exactly the reverse of sorted).

You are responsible for cataloguing a sequence of DNA strings (sequences
containing only the four letters A, C, G, and T). However, you want to catalog
them, not in alphabetical order, but rather in order of sortedness'', frommost sorted’’ to ``least sorted’’. All the strings are of the same length.

衡量一个序列中“不排序”的一个指标是相互之间无序的条目对的数量。例如，在字母序列“DAABEC”中，此度量值为5，因为D在其右侧大于四个字母，E在其右侧大于一个字母。这个度量称为序列中的倒数。序列“AACEDGG”只有一个倒数（E和D）——它几乎被排序——而序列“ZWQM”有6个倒数（它尽可能不排序——正好是排序的倒数）。 你负责对一个DNA序列（序列只包含四个字母a、C、G和T）进行编目。但是，您需要对它们进行分类，而不是按字母顺序，而是按“排序”的顺序，从“最排序”到“最不排序”。所有的弦都是一样长的。

Input

The first line contains two integers: a positive integer n (0 <
n <= 50) giving the length of the strings; and a positive integer m (0 <
m <= 100) giving the number of strings. These are followed by m lines, each
containing a string of length n.

第一行包含两个整数：正整数n（0<n<=50）表示字符串的长度；正整数m（0<m<=100）表示字符串的数量。后面是m行，每行包含一个长度为n的字符串。

Output

Output the list of input strings, arranged from most sorted'' toleast sorted’’. Since two strings can be equally sorted, then output them
according to the orginal order.

输出输入字符串列表，按