#include <stdio.h>
#include <stdlib.h>

void input(int n1, int *K1, int n2, int *K2);

void newArray(int n, int *K, int n1, int *K1, int n2, int *K2);

void sort(int n, int *K);

void output(int m, int *K);

int main () {

    //input

    int n1, n2;
    printf("Insert n1: ");
    scanf("%d", &n1);
    printf("Insert n2: ");
    scanf("%d", &n2);

    int *K1 = (int*) malloc (n1 * (sizeof(int)));
	int *K2 = (int*) malloc (n2 * (sizeof(int)));

    input(n1, K1, n2, K2);

	int m;
    printf("Insert m: ");
    scanf("%d", &m);

	int n = n1 + n2;
	int *K = (int*) malloc (n * (sizeof(int)));
	newArray(n, K, n1, K1, n2, K2);

	sort(n, K);

	output(m, K);

    return 0;
}

void input(int n1, int *K1, int n2, int *K2){
    int i;

    for(i = 0; i < n1; i++) {
        printf("Insert K1[%d] elements: ", i);
        scanf("%d", &K1[i]);
    }

    printf("\n");
    for(i = 0; i < n2; i++) {
        printf("Insert K2[%d] elements: ", i);
        scanf("%d", &K2[i]);
    }

}

void newArray(int n, int *K, int n1, int *K1, int n2, int *K2){
	int i;

    for(i = 0; i < n1; i++) {
		K[i] = K1[i];
    }

    for(i = 0; i < n2; i++) {
		K[i+n1] = K2[i];
    }
}

void sort(int n, int *K){
	int sort;
	do{
		sort = 1;
		int i;
		for(i = 0; i < n-1; i++){
			if(K[i] < K[i+1]){
				int tmp = K[i];
				K[i] = K[i+1];
				K[i+1] = tmp;
				sort = 0;
			}
		}
	}while(sort==0);

}

void output(int m, int *K){
	int i;
    for(i = 0; i < m; i++) {
		printf("Element %d is %d\n", i+1, K[i]);
    }
}