#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e17;
const ll dy[9]={0,1,-1,0,1,1,-1,-1,0};
const ll dx[9]={1,0,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
typedef string::const_iterator State;
struct perser{
    vl number(State &begin){
        vl ret(20);
        if(isdigit(*begin)){
            ret[0]+=*begin-'0';
            begin++;
        }
        else if(*begin=='x'){
            ret[1]++;
            begin++;
        }
        return ret;
    }
    vl factor(State &begin){
        if(*begin=='d'){
            begin++;begin++;
            vl ret=expression(begin);
            vl newret(20);
            rep(i,20){
                if(i)newret[i-1]=ret[i]*i;
            }
            begin++;
            return newret;
        }
        else return number(begin);
    }
    vl term(State &begin){
        vl ret=factor(begin);
        while(1){
            if(*begin=='*'){
                begin++;
                vl to=factor(begin);
                vl newret(20);
                rep(i,20){
                    rep(j,20){
                        if(i+j<20)newret[i+j]+=ret[i]*to[j];
                    }
                }
                ret=newret;
            }
            else break;
        }
        return ret;
    }
    vl expression(State &begin){
        vl ret=term(begin);
        while(1){
            if(*begin=='+'){
                begin++;
                vl to=term(begin);
                rep(i,20)ret[i]+=to[i];
            }
            else break;
        }
        return ret;
    }
};
int main(){
    ll n,d;cin >> n >> d;
    string s;cin >> s;
    perser ps;
    State begin=s.begin();
    auto ans=ps.expression(begin);
    rep(i,d+1)cout << ans[i] <<" ";cout << endl;
}