CD

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
char s[1<<14];
int L,c,S,O[20],C[20],N,A[20],I;
void rec(int u,int v){
    if(u==I){
        if(v>S)S=v,L=c,memcpy(O,C,c<<2);
        return;
    }
    rec(u+1,v);
    if(v+A[u]<=N)C[c++]=A[u],rec(u+1,v+A[u]),--c;
}
int main(void){
    while(~scanf("%d%d",&N,&I)){
        ga(I,A),L=c=0,S=-1;
        rec(0,0);
        F(L)printf("%d ",O[i]);
        printf("sum:%d\n",S);
    }
    return 0;
}