// Merge (union with duplicates) for two ordered tables
#include <stdio.h>
#include <stdlib.h>

int merge(int *in1,int *in2,int *out1,int in1Size,int in2Size)
{
int i,j,k;

i=j=k=0;
while (i<in1Size && j<in2Size)
  if (in1[i]<in2[j])
    out1[k++]=in1[i++];
  else
    out1[k++]=in2[j++];
if (i<in1Size)
  for ( ;i<in1Size;i++)
    out1[k++]=in1[i];
else
  for ( ;j<in2Size;j++)
    out1[k++]=in2[j];
return k;
}

int main()
{
int m,n,p,seed;
int *a,*b,*c;
int i,k;

scanf("%d %d %d",&m,&n,&seed);
srandom(seed);
a=(int*) malloc(m*sizeof(int));
b=(int*) malloc(n*sizeof(int));
c=(int*) malloc((m+n)*sizeof(int));
if (!a || !b ||!c)
{
  printf("malloc failed\n");
  exit(0);
}
i=0;
for (k=0;i<m;k++)
  if (labs(random())%2)
    a[i++]=k;
i=0;
for (k=0;i<n;k++)
  if (labs(random())%2)
    b[i++]=k;
p=merge(a,b,c,m,n);
printf("a: ");
for (i=0;i<m;i++)
  printf("%d ",a[i]);
printf("\n");
printf("b: ");
for (i=0;i<n;i++)
  printf("%d ",b[i]);
printf("\n");
printf("c: ");
for (i=0;i<p;i++)
  printf("%d ",c[i]);
printf("\n");
}