#include <bits/stdc++.h>

using namespace std;

const int N = 30;

int n;
long long a[N];
vector<long long> res;

void dfs(int x, vector< pair<int, int> > y, vector<long long> z, long long now) {
    int m = y.size();
    for (int i = 1; i < m; ++i) {
        if (y[i].first) z[y[i].first] = min(z[y[i].first], z[i]);
        if (y[i].second) z[y[i].second] = min(z[y[i].second], z[i]);
    }
    for (int i = m - 1; i; --i) {
        z[i] = min(z[i], !y[i].first ? now : z[y[i].first] + z[y[i].second]);
    }
    if ((!y[0].first ? now : z[y[0].first] + z[y[0].second]) <= z[0]) return;
    if (x == n + 1) {
        res.push_back(z[0]);
        return;
    }
    y.push_back({0, 0}), y.push_back({0, 0});
    z.push_back(now), z.push_back(now);
    vector<int> fa(m);
    for (int i = 0; i < m; ++i) {
        fa[y[i].first] = fa[y[i].second] = i;
    }
    fa[0] = -1;
    vector<int> con;
    for (int i = 0; i < m; ++i) {
        if (y[i].first || z[i] <= a[x] || z[0] < a[x]) continue;
        con.push_back(i);
    }
    if (con.size() > 2) {
        if (n == 13) con.resize(3);
        else con = {con[0], con.back()};
    }
    for (auto i : con) {
        y[i].first = m, y[i].second = m + 1;
        for (int j = i; ~j; j = fa[j]) z[j] -= a[x];
        dfs(x + 1, y, z, now);
        y[i].first = y[i].second = 0;
        for (int j = i; ~j; j = fa[j]) z[j] += a[x];
    }
    y.pop_back(), y.pop_back();
    z.pop_back(), z.pop_back();
    dfs(x + 1, y, z, min(now, a[x]));
}

signed main() {
    long long m;
    scanf("%lld%d", &m, &n);
    for (int i = 1; i <= n; ++i) scanf("%lld", &a[i]);
    dfs(1, {{}}, {m}, m + 1);
    sort(res.begin(), res.end());
    res.erase(unique(res.begin(), res.end()), res.end());
    reverse(res.begin(), res.end());
    printf("%d\n", (int)res.size());
    for (int i = 0; i < (int)res.size(); ++i) {
        printf("%lld%c", m - res[i], " \n"[i + 1 == (int)res.size()]);
    }
    return 0;
}