#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <stack>
using namespace std;

#define REP(i,s,e) for (i = s; i <= e; i++)
#define rep(i,n) REP (i,0,(int)(n)-1)
#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP (i,(int)(n)-1,0)
#define INF (int)1e8
#define MOD (int)(1e9+7)

typedef long long ll;

int main(void) {
    int n, d;
    string s;
    cin >> n >> d >> s;

    vector<pair<int,int>> terms[20000];
    pair<int,int> term = {0,0};
    int depth = 0;
    for (auto& c : s) {
        if (c == 'x') {
            if (term.first == 0)
                term.first = 1;
            term.second++;
        }
        else if ('1' <= c && c <= '9')
            term.first = c - '0';
        else if (c == '+') {
            terms[depth].push_back(term);
            term.first = 0; term.second = 0;
        }
        else if (c == 'd')
            depth++;
        else if (c == '}') {
            terms[depth].push_back(term);
            term.first = 0; term.second = 0;
            for (auto&& t : terms[depth]) {
                t.first *= t.second;
                t.second--;
                if (t.second >= 0)
                    terms[depth-1].push_back(t);
            }
            terms[depth].clear();
            depth--;
        }
    }
    if (s.back() != '}')
        terms[0].push_back(term);
    int i;
    int ans[11] {};
    for (auto&& t : terms[0])
        ans[t.second] += t.first;
    rep (i,d+1)
        cout << ans[i] << " ";
    cout << endl;
    return 0;
}