#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define UB upper_bound
#define LB lower_bound
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

int n, d;
string s;

struct Poly {
	vector<LL> c;
	Poly() { inc(i, d) { c.PB(0); } }
	Poly & operator+=(const Poly & q) {
		inc(i, d) { c[i] += q.c[i]; }
		return (*this);
	}
};

ostream & operator<<(ostream & os, const Poly & poly) {
	inc(i, d) { os << (i == 0 ? "" : " ") << poly.c[i]; }
	return os;
}

int par[50000];
void pre() {
	int h = 0;
	stack<int> st;
	inc(i, s.size()) {
		if(s[i] == '{') {
			st.push(i);
		}
		if(s[i] == '}') {
			par[st.top()] = i;
			st.pop();
		}
	}
}

// [l, r)
Poly calc1(int l, int r);
Poly calc2(int l, int r);
Poly calc3(int l, int r);

Poly calc3(int l, int r) { // *
	int c = 1, dd = 0;
	incID(i, l, r) {
		if(s[i] == 'x') { dd++; }
		if(inII(s[i], '0', '9')) { c *= (s[i] - '0'); }
	}
	Poly poly;
	poly.c[dd] = c;
	return poly;
}

Poly calc2(int l, int r) { // d
	Poly poly;
	poly += calc1(l, r);
	inc(i, d) {
		poly.c[i] = (i + 1 < d ? poly.c[i + 1] * (i + 1) : 0);
	}
	return poly;
}

Poly calc1(int l, int r) { // +
	Poly poly;
	int pp = l;
	incII(i, l, r) {
		if(i == r || s[i] == '+') {
			poly += calc3(pp, i);
			pp = i + 1;
		}
		if(i == r) { break; }
		if(s[i] == 'd') {
			poly += calc2(i + 2, par[i + 1]);
			pp = par[i + 1] + 2;
			i  = par[i + 1] + 1;
		}
	}
	return poly;
}

int main() {
	cin >> n >> d >> s;
	
	d++;
	pre();
	cout << calc1(0, n) << endl;
	
	return 0;
}