#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

int n, d;
string s;

void solve(int& i, vector<long long>& a)
{
    a.assign(d+1, 0);

    long long coefficient = 0;
    int degree = 0;

    for(;;){
        if(i == n || s[i] == '}'){
            a[degree] += coefficient;
            return;
        }
        if(s[i] == 'd'){
            i+= 2;
            vector<long long> b;
            solve(i, b);
            for(int j=1; j<=d; ++j)
                a[j-1] += b[j] * j;
        }
        else if(s[i] == '+'){
            a[degree] += coefficient;
            coefficient = 0;
            degree = 0;
        }
        else if(s[i] == 'x'){
            if(coefficient == 0)
                coefficient = 1;
            ++ degree;
        }
        else if(isdigit(s[i])){
            if(coefficient == 0)
                coefficient = 1;
            coefficient *= s[i] - '0';
        }
        ++ i;
    }
}

int main()
{
    cin >> n >> d >> s;

    int i = 0;
    vector<long long> a;
    solve(i, a);

    cout << a[0];
    for(int j=1; j<=d; ++j)
        cout << ' ' << a[j];
    cout << endl;

    return 0;
}