#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
#include<complex>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>
#include<stack>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef complex<double> C;

int d;
typedef string::const_iterator State;

vector<ll> expression(State& begin);
vector<ll> term(State& begin);

void print(const vector<ll>& x) {
    for (int i = 0; i <= d; i++) {
        cout << x[i];
        if (i != d) cout << " ";
    }
    cout << endl;
}

vector<ll> expression(State& begin) {
    vector<ll> ret(d+1);
    for (;;) {
        if (*begin == 'd') {
            begin++;
            begin++;
            auto x = expression(begin);
            for (int i = 1; i <= d; i++) ret[i-1] += x[i]*i;
            begin++;
//        } else if (*begin == '{') {
//            begin++;
//            auto x = expression(begin);
//            for (int i = 0; i <= d; i++) ret[i] += x[i];
//            begin++;
        } else if (*begin == 'x' || isdigit(*begin)) {
            auto x = term(begin);
            for (int i = 0; i <= d; i++) ret[i] += x[i];
        } else if (*begin == '+') {
//            cout << "before: ";
//            print(ret);
            begin++;
            auto x = expression(begin);
            for (int i = 0; i <= d; i++) ret[i] += x[i];
//            cout << "after: ";
//            print(ret);
        }
        else break;
    }
    return ret;
}

vector<ll> term(State& begin) {
    ll c = 1;
    int degree = 0;
    for (;;) {
        if (*begin == 'x') degree++;
        else if (*begin == '*') {}
        else if (isdigit(*begin)) c *= (*begin-'0');
        else break;
        begin++;
    }
    vector<ll> ret(d+1);
    ret[degree] += c;
    return ret;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    cin >> d;
    string s;
    cin >> s;
    State begin = s.begin();
    auto x = expression(begin);
    print(x);
    return 0;
}