import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N;
int D;
string S;

BigInt[] add(in BigInt[] a, in BigInt[] b) {
  BigInt[] c = new BigInt[D + 1];
  foreach (i; 0 .. D + 1) {
    c[i] = a[i] + b[i];
  }
  return c;
}
BigInt[] mul(in BigInt[] a, in BigInt[] b) {
  BigInt[] c = new BigInt[D + 1];
  foreach (i; 0 .. D + 1) foreach (j; 0 .. D - i + 1) {
    c[i + j] += a[i] * b[j];
  }
  return c;
}
BigInt[] dif(in BigInt[] a) {
  BigInt[] b = new BigInt[D + 1];
  foreach (i; 1 .. D + 1) {
    b[i - 1] = i * a[i];
  }
  return b;
}

int cur;

BigInt[] expr() {
  BigInt[] ret = term();
  for (; S[cur] == '+'; ) {
    ++cur;
    const tmp = term();
    ret = add(ret, tmp);
  }
  debug {
    writeln("expr ", ret);
  }
  return ret;
}
BigInt[] term() {
  BigInt[] ret = factor();
  for (; S[cur] == '*'; ) {
    ++cur;
    const tmp = factor();
    ret = mul(ret, tmp);
  }
  debug {
    writeln("term ", ret);
  }
  return ret;
}
BigInt[] factor() {
  BigInt[] ret;
  if (S[cur] == 'd') {
    ++cur;
    assert(S[cur] == '{');
    ++cur;
    const tmp = expr();
    ret = dif(tmp);
    assert(S[cur] == '}');
    ++cur;
  } else if (S[cur] == 'x') {
    ++cur;
    ret = new BigInt[D + 1];
    ret[1] = 1;
  } else if ('0' <= S[cur] && S[cur] <= '9') {
    ret = new BigInt[D + 1];
    ret[0] = S[cur++] - '0';
  } else {
    assert(false);
  }
  debug {
    writeln("factor ", ret);
  }
  return ret;
}

void main() {
  try {
    for (; ; ) {
      N = readInt();
      D = readInt();
      S = readToken();
      
      S ~= '$';
      cur = 0;
      const ans = expr();
      writeln(ans.to!string.replaceAll(regex(`[\[\],]`), ""));
    }
  } catch (EOFException e) {
  }
}