using System; using System.Linq; using System.Diagnostics; using System.Collections.Generic; using Debug = System.Diagnostics.Debug; using StringBuilder = System.Text.StringBuilder; using System.Numerics; namespace Program { public class Solver { public void Solve() { var n = sc.Integer(); var d = sc.Integer(); NumberEx.Polynomial.MAX = d + 1; var parser = new StringEx.Parser(sc.Scan()); parser.d = d + 1; var ptr = 0; var ans = parser.expression(ref ptr); IO.Printer.Out.WriteLine(ans.p.AsJoinedString()); } public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput()); static T[] Enumerate(int n, Func f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; } static public void Swap(ref T a, ref T b) { var tmp = a; a = b; b = tmp; } } } #region main static class Ex { static public string AsString(this IEnumerable ie) { return new string(System.Linq.Enumerable.ToArray(ie)); } static public string AsJoinedString(this IEnumerable ie, string st = " ") { return string.Join(st, ie); } static public void Main() { var solver = new Program.Solver(); solver.Solve(); Program.IO.Printer.Out.Flush(); } } #endregion #region Ex namespace Program.IO { using System.IO; using System.Text; using System.Globalization; public class Printer : StreamWriter { static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; } public static Printer Out { get; set; } public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } } public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { } public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { } public void Write(string format, T[] source) { base.Write(format, source.OfType().ToArray()); } public void WriteLine(string format, T[] source) { base.WriteLine(format, source.OfType().ToArray()); } } public class StreamScanner { public StreamScanner(Stream stream) { str = stream; } public readonly Stream str; private readonly byte[] buf = new byte[1024]; private int len, ptr; public bool isEof = false; public bool IsEndOfStream { get { return isEof; } } private byte read() { if (isEof) return 0; if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } } return buf[ptr++]; } public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; } public string Scan() { var sb = new StringBuilder(); for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b); return sb.ToString(); } public string ScanLine() { var sb = new StringBuilder(); for (var b = Char(); b != '\n'; b = (char)read()) if (b == 0) break; else if (b != '\r') sb.Append(b); return sb.ToString(); } public long Long() { if (isEof) return long.MinValue; long ret = 0; byte b = 0; var ng = false; do b = read(); while (b != '-' && (b < '0' || '9' < b)); if (b == '-') { ng = true; b = read(); } for (; true; b = read()) { if (b < '0' || '9' < b) return ng ? -ret : ret; else ret = ret * 10 + b - '0'; } } public int Integer() { return (isEof) ? int.MinValue : (int)Long(); } public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); } private T[] enumerate(int n, Func f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(); return a; } public char[] Char(int n) { return enumerate(n, Char); } public string[] Scan(int n) { return enumerate(n, Scan); } public double[] Double(int n) { return enumerate(n, Double); } public int[] Integer(int n) { return enumerate(n, Integer); } public long[] Long(int n) { return enumerate(n, Long); } } } #endregion #region Number namespace NumberEx { using Number = Int64; public struct Polynomial { static public int MAX; public Number[] p; public Polynomial(int d) { p = new Number[d]; } static Polynomial multiply(Polynomial l, Polynomial r) { var ret = new Polynomial(MAX); for (int i = 0; i < l.p.Length; i++) for (int j = 0; j < r.p.Length; j++) if (i + j < MAX) ret.p[i + j] += l.p[i] * r.p[j]; return ret; } static Polynomial add(Polynomial l, Polynomial r) { var ret = new Polynomial(MAX); for (int i = 0; i < l.p.Length; i++) ret.p[i] += l.p[i]; for (int i = 0; i < r.p.Length; i++) ret.p[i] += r.p[i]; return ret; } static Polynomial sub(Polynomial l, Polynomial r) { var ret = new Polynomial(MAX); for (int i = 0; i < l.p.Length; i++) ret.p[i] += l.p[i]; for (int i = 0; i < r.p.Length; i++) ret.p[i] -= r.p[i]; return ret; } static public Polynomial Differntial(Polynomial v) { var ret = new Polynomial(MAX); for (int i = 1; i < v.p.Length; i++) ret.p[i - 1] = v.p[i] * i; return ret; } public static Polynomial operator +(Polynomial l, Polynomial r) { return add(l, r); } public static Polynomial operator -(Polynomial l, Polynomial r) { return sub(l, r); } public static Polynomial operator *(Polynomial l, Polynomial r) { return multiply(l, r); } } } #endregion #region Parser namespace StringEx { using Number = NumberEx.Polynomial; public class Parser { char[] s; int len; public int d; public Parser(string str) { s = str.ToCharArray(); len = s.Length; } public Parser(char[] str) { s = str; len = s.Length; } //number public Number number(ref int ptr) { Number ret = new Number(d); while (ptr < len) { if (char.IsDigit(s[ptr])) { ret.p[0] = s[ptr] - '0'; ptr++; } else if (s[ptr] == 'x') { ret.p[1] = 1; ptr++; } else break; } return ret; } // number *|/ factor(number) public Number term(ref int ptr) { var ret = factor(ref ptr); while (ptr < len) { if (s[ptr] == '*') { ptr++; ret *= factor(ref ptr); } else break; } return ret; } // number +|- term public Number expression(ref int ptr) { var ret = term(ref ptr); while (ptr < len) { if (s[ptr] == '+') { ptr++; ret += term(ref ptr); } else break; } return ret; } // ( expression ) | number public Number factor(ref int ptr) { if (s[ptr] == 'd') { ptr++; ptr++; var ret = Number.Differntial(expression(ref ptr)); ptr++; return ret; } else return number(ref ptr); } } } #endregion