#include <cstdio>
#include <cstring>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <map>
#include <cmath>
#include <cctype>
#include <set>

namespace uvu
{
#define LOCAL ____________DONT_DEFINE_ME____________
// #define ll long long
// #define inf 0x3f3f3f3f
#define int long long
#define inf 0x3f3f3f3f3f3f3f3fll
#define infll 0x3f3f3f3f3f3f3f3fll
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define gline debug("now is #%d\n", __LINE__)
#define pii std::pair <int, int>
#define mkp std::make_pair
#define fi first
#define se second
char _ST_;
const int BUFSIZE = (1 << 20);
char ibuf[BUFSIZE], *iS = ibuf, *iT = ibuf;
char obuf[BUFSIZE], *oS = obuf, *oT = obuf + BUFSIZE;
char getc()
{
#ifdef LOCAL
	return getchar();
#else
	if(iS == iT) iT = (iS = ibuf) + fread(ibuf, 1, BUFSIZE, stdin);
	return iS == iT ? EOF : *iS++;
#endif
#define getchar ERR
}

void Flush() { fwrite(obuf, 1, oS - obuf, stdout); oS = obuf; }
struct Flusher { ~Flusher(){ Flush(); } }iamflusher;

void putc(char c)
{
#ifdef LOCAL
	putchar(c);
#else
	*oS++ = c;
	if(oS == oT) Flush();
#endif
#define putchar ERR
}

template <typename T = int> T read()
{
	T x = 0, f = 1; char c = getc();
	for(; !isdigit(c); c = getc()) if(c == '-') f = -1;
	for(;  isdigit(c); c = getc()) x = (x << 3) + (x << 1) + (c ^ 48);
	return x * f;
}

template <typename T> void print(T x, char c)
{
static int sta[BUFSIZE], top;
	top = 0;
	if(x < 0) putc('-'), x = -x;
	if(!x) sta[top = 1] = 0;
	for(; x; x /= 10) sta[++top] = x % 10;
	for(; top; ) putc(sta[top--] ^ 48);
	if(c) putc(c);
}

int readstr(char *s, int base)
{
	int idx = base - 1; char c = getc();
	for(; !(isdigit(c) || isalpha(c) || c == '(' || c == '?'); c = getc());
	for(;   isdigit(c) || isalpha(c) || c == '(' || c == '?' ; c = getc()) s[++idx] = c;
	return idx - base + 1;
}

void printf(const char *s) { for(; *s; s++) putc(*s); }
template <typename T, typename ... Args>
void printf(const char *s, T x, Args ... rest)
{
	for(; *s; s++)
	{
		if(*s != '%') { putc(*s); continue; }
		s++; if(*s == 'd') print(x, 0);
		else if(*s == 'c') putc(x);
		printf(s + 1, rest ...);
		return;
	}
}

template <typename T> void ckmax(T &x, T y) { x = x > y ? x : y; }
template <typename T> void ckmin(T &x, T y) { x = x < y ? x : y; }
#define mod 998244353
// #define mod 1000000007
int sm(int x) { return x >= mod ? x - mod : x; }
void plus_(int &x, int y) { x = (x + y >= mod ? x + y - mod : x + y); }
void mul_(int &x, int y) { x = 1ll * x * y % mod; }
int ksm(int a, int b) { int res = 1; for(; b; b >>= 1, mul_(a, a)) if(b & 1) mul_(res, a); return res; }

int m, n;
int a[20], p[20];
bool vis[20];
int sum[1 << 16];
int dp[1 << 16];
int pre[20];
int sta[1 << 16], top;
int fb[1 << 16];
int ans[1 << 16], tot;

void solve()
{
	// memset(h, idx = -1, sizeof(h));
	m = read(), n = read();
	for(int i = 0; i < n; i++) a[i] = read(), fb[1 << i] = i;
	for(int S = 0; S < (1 << n); S++) for(int i = 0; i < n; i++) if(S >> i & 1) sum[S] += a[i];
	for(int T = 0; T < (1 << n); T++)
	{
		pre[0] = m + 1; for(int i = 1; i <= n; i++) pre[i] = std::min(pre[i - 1], (T >> (i - 1) & 1) ? m + 1 : a[i - 1]);
		dp[0] = pre[n]; top = 0;
		for(int S = T; S; S = (S - 1) & T) sta[++top] = S;
		std::reverse(sta + 1, sta + 1 + top);
		for(int _ = 1; _ <= top; _++)
		{
			int S = sta[_], p = fb[S & (-S)]; dp[S] = -inf;
			if(sum[S] >= pre[p]) continue;
			for(int T = S ^ (1 << p); ; T = (T - 1) & (S ^ (1 << p)))
			{
				ckmax(dp[S], std::min(dp[T] + a[p] + dp[S ^ T ^ (1 << p)], pre[p]));
				if(!T) break;
			}
		}
		// printf("sum[%d] = %d (%d)\n", T, sum[T], dp[T]);
		if(dp[T] > m) ans[++tot] = sum[T];
	}
	std::sort(ans + 1, ans + tot + 1);
	tot = std::unique(ans + 1, ans + 1 + tot) - ans - 1;
	print(tot, '\n');
	for(int i = 1; i <= tot; i++) print(ans[i], ' ');
	putc('\n');
}

void init()
{
	
}

char _ED_;

void mian()
{
	debug("%.3f MB\n", abs(&_ST_ - &_ED_) / 1024.0 / 1024);
	init(); int T = 1;
	for(; T; solve(), T--);
}

#ifdef int
	#undef int
#endif
}

int main()
{
// 	freopen("tmp.in", "r", stdin);
	// freopen("tmp.out", "w", stdout);
	uvu::mian(); return 0;
}