#include<bits/stdc++.h> using namespace std; #define ALL(x) begin(x),end(x) #define rep(i,n) for(int i=0;i<(n);i++) #define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl; #define mod 1000000007 using ll=long long; const int INF=1000000000; const ll LINF=1001002003004005006ll; int dx[]={1,0,-1,0},dy[]={0,1,0,-1}; // ll gcd(ll a,ll b){return b?gcd(b,a%b):a;} template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;} template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;} struct IOSetup{ IOSetup(){ cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(12); } } iosetup; template<typename T> ostream &operator<<(ostream &os,const vector<T>&v){ for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" "); return os; } template<typename T> istream &operator>>(istream &is,vector<T>&v){ for(T &x:v)is>>x; return is; } int n,d; vector<int> add(vector<int> l,vector<int> r){ rep(i,d+1) l[i]+=r[i]; return l; } vector<int> mul(vector<int> l,vector<int> r){ vector<int> ret(d+1,0); rep(i,d+1)rep(j,d+1)if(i+j<=d) ret[i+j]+=l[i]*r[j]; return ret; } vector<int> diff(vector<int> v){ vector<int> ret(d+1,0); for(int i=d;i>0;i--) ret[i-1]=v[i]*i; return ret; } vector<int> expression(string &s,int &p); vector<int> term(string &s,int &p); vector<int> factor(string &s,int &p); vector<int> number(string &s,int &p); vector<int> expression(string &s,int &p){ vector<int> res=term(s,p); while(p<(int)s.size()){ if(s[p]=='+'){ p++; res=add(res,term(s,p)); continue; } break; } return res; } vector<int> term(string &s,int &p){ auto res=factor(s,p); while(p<(int)s.size()){ if(s[p]=='*'){ p++; res=mul(res,factor(s,p)); continue; } break; } return res; } vector<int> factor(string &s,int &p){ vector<int> ret(d+1,0); if(s[p]=='d'){ p+=2; auto mid=expression(s,p); p++; return diff(mid); } return number(s,p); } vector<int> number(string &s,int &p){ vector<int> ret(d+1,0); if(s[p]=='x'){ ret[1]=1; p++; } else{ int num=0; while(p<(int)s.size() and isdigit(s[p])) num=num*10+s[p++]-'0'; ret[0]=num; } return ret; } signed main(){ cin>>n; cin>>d; string s;cin>>s; int ptr=0; auto res=expression(s,ptr); cout<<res<<endl; return 0; }