// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

const int MAXN = 1e5 + 5;

int N, M;
LL A[MAXN];

void input()
{
    read(N); read(M);
    for (int i = 1; i <= M; ++i) {
        read(A[i]);
    }
}

void solve()
{
    static LL st[MAXN];
    int top = 0;

    st[++top] = N;
    for (int i = 1; i <= M; ++i) {
        while (top > 0 && st[top] >= A[i]) {
            --top;
        }
        st[++top] = A[i];
    }
    M = top;
    std::copy(st + 1, st + M + 1, A + 1);

    static LL cnt[MAXN], ans[MAXN];

    cnt[M] = 1;
    for (int i = M; i >= 1; --i) {
        LL t = A[i];
        for (int j = i - 1; j >= 1; --j) {
            int p = 0;
            for (int k = 1 << (31 - __builtin_clz(j)); k; k >>= 1) {
                if (p + k <= j && t >= A[p + k])
                    p += k;
            }
            if (!p)
                break;
            cnt[p] += cnt[i] * (t / A[p]);
            t %= A[p];
            j = p;
        }
        assert(0 <= t && t <= N);
        ans[t] += cnt[i];
    }
    for (int i = N; i > 1; --i) {
        ans[i - 1] += ans[i];
    }

    for (int i = 1; i <= N; ++i) {
        printf("%lld\n", ans[i]);
    }
}

int main()
{
#ifdef __DEBUG
    freopen("E.in", "r", stdin);
    freopen("E.out", "w", stdout);
#endif

    input();
    solve();

    return 0;
}

// 无边落木萧萧下，不尽长江滚滚来。
//     -- 杜甫《登高》


Measured memory_bytes: 4864