#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int main(){
    int N, d;
    string S;
    cin >> N >> d >> S;
    int all[d + 1], times_degree = 1, times_coefficient = 0, depth_of_function = 0;
    fill(all, all + d + 1, 0);
    for(int i = 0; i < N; i++){
        if(S[i] == '+'){
            if(S[i - 1] != '}'){
                if(depth_of_function <= times_coefficient){
                    for(int j = times_coefficient; j > times_coefficient - depth_of_function; j--){
                        times_degree *= j;
                    }
                    all[times_coefficient - depth_of_function] += times_degree;
                }
                times_degree = 1;
                times_coefficient = 0;
            }
        }else if('0' <= S[i] && S[i] <= '9'){
            times_degree *= S[i] - '0';
        }else if(S[i] == 'x'){
            times_coefficient++;
        }else if(S[i] == '{'){
            depth_of_function++;
        }else if(S[i] == '}'){
            if(S[i - 1] != '}'){
                if(depth_of_function <= times_coefficient){
                    for(int j = times_coefficient; j > times_coefficient - depth_of_function; j--){
                        times_degree *= j;
                    }
                    all[times_coefficient - depth_of_function] += times_degree;
                }
                times_degree = 1;
                times_coefficient = 0;
            }
            depth_of_function--;
        }
    }
    if(S.back() != '}'){
        all[times_coefficient] += times_degree;
    }
    string ans_string = "";
    for(int i = 0; i <= d; i++){
        ans_string += to_string(all[i]) + " ";
    }
    ans_string.pop_back();
    cout << ans_string << endl;
}