#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/

int N,D;
string S;

vector<int> parse(string s) {
    int r = 0;
    vector<int> a(D,0);
    if (s[0]=='d') {
        r = 1;
        int cnt = 0;
        do {
            if (s[r]=='{') cnt++;
            else if (s[r]=='}') cnt--;
            r++;
        } while(cnt);
        auto b = parse(s.substr(2,r-3));
        REP(i,D-1) a[i] += b[i+1]*(i+1);
    }
    else {
        int x = 0;
        int num = 1;
        while(r < s.length()) {
            if (s[r]=='+') break;
            if (s[r]=='x') x++;
            if (s[r]=='*') {};
            int n = s[r]-'0';
            if (1 <= n && n <= 9) num *= n;
            r++;
        }
        a[x] += num;
    }
    if (s[r]=='+') {
        auto b = parse(s.substr(r+1, s.length()-r-1));
        REP(i,D) a[i] += b[i];
    }
    return a;
}

void solve() {
    cin>>N>>D>>S;
    D++;
    auto a = parse(S);
    REP(i,D) cout << a[i] << " ";
    cout << endl;
}