#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>
#include <random>
#include <functional>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)

typedef long long ll;

#define int long long

vector<int> ans;
const char* p;
int depth;

void term() {
  char* end;
  pair<int, int> ret(1, 0);
  while(*p != 0) {
    if(*p == '+' || *p == '}') break;
    else if(isdigit(*p)) {
      ret.first *= strtol(p, &end, 10);
      p = end;
//      cout << "E: " << *p << endl;
    }
    else if(*p == 'x') {
      ret.second ++;
      p++;
    }
    else {
      p++;
    }
  }

  if(ret.second-depth < 0) {
//    cout << "DEPTH: " << depth << endl;
//    cout << "DELETED\n";
  }
  else {
//    cout << "DETPH: " << depth << endl;
//    cout << "微分前 係数: " << ret.first << ", xの次数: " << ret.second << endl;
    int xdegmul = 1;
    int declx = ret.second;
    rep(i, depth) xdegmul *= declx--;
//    cout << "微分後 係数: " << ret.first * xdegmul << ", 次数: " << ret.second-depth << endl;
    ans[ret.second-depth] += ret.first * xdegmul;
  }
}

signed main() {

  int N, d; string s;
  cin >> N >> d >> s;
  p = s.c_str();
  ans.resize(d+1);

  depth = 0;
  while(*p != 0) {

    if(*p == 'd') {
      p+=2; depth++;
    }
    else if(*p == '}') {
      p++; depth--;
    }
    else if(*p == '+') {
      p++;
    }
    else {
      term();
    }

  }

  rep(i, d+1) {
    if(i) cout << " ";
    cout << ans[i];
  }
  cout << endl;

  return 0;
}