#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
#include<set>
#define mem(a,x) memset(a,x,sizeof(a))
#define s1(x) scanf("%d",&x)
#define s2(x,y) scanf("%d%d",&x,&y)
#define s3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define s4(x,y,z,k) scanf("%d%d%d%d",&x,&y,&z,&k)
#define ff(a,n) for(int i = 0 ; i < n; i++) scanf("%d",a+i)
#define tp(x) printf("x = %d\n",x)
#define ansp(x) printf("%d\n",x)
#define ls 2*rt
#define rs 2*rt+1
#define lson ls,L,mid
#define rson rs,mid+1,R
#define ll long long
using namespace std;
typedef pair<int,int> pii;
const ll inf = 0x3f3f3f3f;
const int mx = 3e3+10;
int n,m;
int a[mx],ha[10001];
int main(){
while(s2(n,m) != EOF){
for(int i = 0; i < n; i++)
scanf("%d",a+i);
for(int i = 0; i < n; i++)
for(int j = i+1; j < n; j++){
ha[a[i]+a[j]]++;
}
int k = m;
for(int i=10000; i >= 0 && k; ){
if(!ha[i]){
i--;
continue;
}
if(k == m){
printf("%d",i);
}
else
printf(" %d",i);
k--;
ha[i]--;
}
puts("");
}
return 0;
}
