#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define F first
#define S second
#define pb push_back
#define INF 1e18
#define MOD 1000000007
#define N 1000015
#define ex(V) return printf(V),0
using namespace std;
int p[N];
int fnd(int x){return p[x]=p[x]==x?x:fnd(p[x]);}
void unn(int x,int y){p[fnd(y)]=fnd(x);}
int dir[4][2]={{0,1},{1,0},{0,-1},{-1,0}};
int gcd(int x,int y){return x%y?gcd(y,x%y):y;}
int a[100105];
int main(){
	int n,mod;
	freopen(".22.in","r",stdin);
	freopen(".22.out","w",stdout);
	scanf("%d%d",&n,&mod);
	for(int i=0;i<n;i++)scanf("%d",a+i);
	sort(a,a+n);
	if(mod==2)for(int i=0;i<n;i++)printf("%d ",a[i]);
	else for(int i=n-1;i>=0;i--)printf("%d ",a[i]);
}