#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <unordered_map>
using namespace std;
#define fi first
#define sc second
#define mkp make_pair
#define pii pair<int,int>
#define pll pair<ll,int>
typedef long long ll;
const int N=2e5+5,K=505,oo=1e9,mod=998244353;
inline int read() {
    int x=0,flag=0;char ch=getchar();
    while(ch<'0'||ch>'9') {flag|=(ch=='-');ch=getchar();}
    while('0'<=ch&&ch<='9') {x=(x<<3)+(x<<1)+ch-'0';ch=getchar();}
    return flag?-x:x;
}
inline int mx(int x,int y) {return x>y?x:y;}
inline int mn(int x,int y) {return x<y?x:y;}
inline void swp(int &x,int &y) {x^=y^=x^=y;}
inline int as(int x) {return x>0?x:-x;}
inline void add(int&x,int y) {x=(x+y>=mod?x+y-mod:x+y);}

unordered_map<int,int>mp,Mp;
int n,k,a[N],qwq[K<<2]; bool vis[N];
int main() {
    n=read();k=read();
    for(int i=1;i<=n+k;++i) a[i]=read(),Mp[a[i]]=i;
    if(n<=2*k) {
        for(int i=1;i<=k+1;++i)
            for(int j=n;j<=n+k;++j)
                qwq[++qwq[0]]=a[i]+a[j];
        sort(qwq+1,qwq+qwq[0]+1); qwq[0]=unique(qwq+1,qwq+qwq[0]+1)-qwq-1;
    } else {
        for(int i=1;i<=2*k;++i)
            for(int j=n+k-2*k+1;j<=n+k;++j)
                ++mp[a[i]+a[j]];
        for(auto&V:mp) 
            if(V.sc>=k) 
                qwq[++qwq[0]]=V.fi;
    }
    for(int i=1;i<=qwq[0];++i) {
        int sum=0;
        for(int j=1;j<=n+k;++j)
            if(a[j]<(qwq[i]-1)/2+1&&Mp.count(qwq[i]-a[j]))
                ++sum;
        if(sum>=n/2) {
            sum=0;
            for(int j=1;j<=n+k;++j)
                if(a[j]<(qwq[i]-1)/2+1&&Mp.count(qwq[i]-a[j])) {
                    vis[j]=1,vis[Mp[qwq[i]-a[j]]]=1;
                    ++sum;
                    if(sum==n/2) break;
                }
            break;
        }
    }
    for(int i=1;i<=n+k;++i)
        if(vis[i]) printf("%d ",a[i]);
    return 0;
}