#include <bits/stdc++.h>

using namespace std;

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<ll> vl;

#define all(a)  (a).begin(),(a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#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 range(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)  range(i,0,n)
#define clr(a,b) memset((a), (b) ,sizeof(a))
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

const double eps = 1e-10;
const double pi  = acos(-1.0);
const ll INF =1LL << 62;
const int inf =1 << 29;

ll n,d;
string s;
int cur=0;

vl term();
vl expression();

ll digit(){
	if(isdigit(s[cur])){
		int n = s[cur] - '0';
		cur++;
		return n;
	}else{
		cur++;
		return -1;
	}
}

vl term(){
	vl res(d+1,0);
	if(s[cur]=='d'){
		cur+=2;
		vl arg=expression();
		cur++;
		for(int i=1;i<=d;++i) res[i-1]+=arg[i]*i;
		return res;
	}else{
		int coef = 1,dim = 0;
		int check=digit();
		if(check==-1) dim++; else coef*=check;
		while(cur < n && s[cur] == '*'){
			cur++;
			int check=digit();
			if(check==-1) dim++; else coef*=check;
		}
		res[dim]=coef;
		return res;
	}
}

vl expression(){
	vl sum = term();
	while(cur < n && s[cur] == '+'){
		cur++;
		vl arg = term();
		rep(i,d+1) sum[i]+=arg[i];
	}
	return sum;
}

// <var>  0-9,x
// <term>::= <var> | <term> * <var> | d{ <expression> }
// <expression> ::= <term> | <expression> + <term>

int main(void){
	cin >> n >> d;
	cin >> s;
	vl res=expression();
	rep(i,d+1) cout << (i?" ":"") << res[i];
	cout << endl;
	return 0;
}