#include <bits/stdc++.h>

using namespace std;

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

int p(int a, int b){
  int res = 1;
  for(int i=0;i<b;++i) res *= a-i;
  return res;
}

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  int N; cin >> N;
  int d; cin >> d;
  string s; cin >> s;
  VI ans(d+1, 0);

  int lv = 0;
  for(int i=0;i<N;){
	switch(s[i]){
	case 'd':
	  ++lv;
	  i += 2;
	  break;
	case '}':
	  --lv;
	  ++i;
	  break;
	case '+':
	  ++i;
	  break;
	default:{
	  int deg = 0, c = 1;
	  for(;i<N;){
		if(s[i] == 'x'){
		  ++deg;
		  ++i;
		}
		else if(s[i] == '*'){
		  ++i;
		}
		else if('0' <= s[i] && s[i] <= '9'){
		  c *= s[i++] - '0';
		}
		else{
		  break;
		}
	  }
	  if(deg >= lv)
		ans[deg-lv] += c * p(deg,lv);
	}
	}
  }
  for(int i=0;i<=d;++i)
	cout << (i?" ":"") << ans[i];
  cout << endl;
  
  return 0;
}