#include <stdio.h>
void mao(int a[],int n)
{
	for(int i = 0; i < n - 1; i++){
    	for(int j = 0; j < n - 1 - i; j++){
    		if(a[j] > a[j + 1]){
    			int x = a[j];
    			a[j] = a[j + 1];
    			a[j + 1] = x;
			}
		}
	}
}
int main()
{
    int n,k;
    scanf("%d%d",&n,&k);
    int c[n],b[n];
    for(int i = 0; i < n; i++)scanf("%d",&c[i]);
    for(int i = 0; i < n; i++)scanf("%d",&b[i]);
    mao(c, n);
    mao(b, n);
    for(int i = 0; i < n; i++)printf("%d ",c[i]);
    printf("\n");
    for(int i = 0; i < n; i++)printf("%d ",b[i]);
    return 0; 
}

#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#include<cmath>
using namespace std;
#define ll long long
ll n,a,b,T,k,m;
const int N = 1e5 + 10;


int main()
{
	int a[N];
	int b[N];
	cin >> n >> m;
	for(int i = 0; i < n; i++){
		scanf("%d",&a[i]);
	}
	for(int i = 0; i < n; i++){
		scanf("%d",&b[i]);
	}
	sort(a, a + n);
	sort(b, b + n);
	for(int i = 0; i < n; i++){
		cout << a[i] << ' ';
	}
	cout<<"\n";
	for(int i = 0; i < n; i++){
		cout << b[i] << ' ';
	}
	return 0;
}