#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cstring>

typedef long long ll;
using namespace std;

#define mod 1000000007
#define INF 1000000000
#define LLINF 2000000000000000000LL
#define PI 3.1415926536

#define SIZE 1000002

int n,d;
string s;


vector<int> df(vector<int> vec){
    
    for(int i=1;i<vec.size();i++){
        vec[i-1] = vec[i]*i;
    }
    
    return vec;
}

vector<int> dfs(int l,int r){
    vector<int> ret(11,0);
    for(int i=l;i<=r;){
        int cc=0,k=1;
        bool f = false;
        
        if(s[i]=='d'){
            cc=0;
            for(int j=i;;j++){
                if(s[j]=='{') cc++;
                
                if(s[j]=='}'){
                    cc--;
                    if(cc>0) continue;
                    
                    vector<int> d =dfs(i+2,j-1);
                    d = df(d);
                    for(int m=0;m<d.size();m++){
                        ret[m]+=d[m];
                    }
                    
                    i = j+2;
                    f = true;
                    break;
                }
            }
        }
        
        if(f) continue;
        
        
        while(1){
            if(s[i]=='x')
                cc++;
            else
                k*=s[i]-'0';
            
            if(r==i || s[i+1]=='+'){
                i+=2;
                break;
            }else{
                i+=2;
            }
        }
        
        ret[cc]+=k;
    }
    
    return ret;
    
}

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

    
    vector<int> ans = dfs(0,(int)s.size()-1);
    
    for(int i=0;i<=d;i++){
        printf(i!=d? "%d ":"%d\n",ans[i]);
    }
    
    
    return 0;
}