#include <iostream>
#include <algorithm>
using namespace std;
bool cmp(int x,int y)
{
	return x > y;
}
int main()
{
	int n,m;
	cin >> n >> m;
	int a[m];
	for (int i = 0;i < m;i++)
		cin >> a[i];
	if (n == 1)
		sort(a,a + m);
	else
		sort(a,a + m,cmp);
	for (int i = 0;i < m - 1;i++)
		cout << a[i] << ',';
	cout << a[m - 1];
	return 0;
}

#include <bits/stdc++.h>
#define LL long long
using namespace std;
const int N = 1000 + 10;
const int INF = 0x3f3f3f3f;
int n , m;
int a [N];
int main()
{
	    cin >> m >> n;
	    for (int i = 1; i <= n; i++)
	        cin >> a [i];
	    if ( m == 1 ) sort (a + 1 , a + n + 1);
	    else sort (a + 1 , a + n + 1 , greater <int> ());
	    for (int i = 1; i < n; i++)
	        cout << a [i] << ",";
	    cout << a [n];
		return 0;
}