> #include<iostream>
> #include<string>
> #include<vector>
> #include<algorithm>
> using namespace std;
> typedef struct
>    {string ch;
>      int num;
>    }st;
> vector<st>s;  
> bool sortspecial(st v1,st v2)
> {
>     return v1.num<v2.num;
> }       
> int main()
> {
>     int n,m,i,j,k;
>     cin>>n>>m;
>     s.resize(m);
>     for(i=0;i<m;i++)
>      {
>       cin>>s[i].ch;
>       for(j=0;j<n-1;j++)
>        for(k=j+1;k>=0;k--)
>         {
>            if((s[i].ch)[k]>(s[i].ch)[j])s[i].num++; 
>            
>         }
>      }
>      stable_sort(s.begin(),s.end(),sortspecial);
>      for(i=0;i<m;i++)
>        cout<<s[i].ch<<endl;
>        return 0;   
> }