def mul(a,b,n,m):
    ans = [0]*(n+m-1)
    for i in range(n):
        for j in range(m):
            ans[i+j]+=a[i]*b[j]
    return ans
x1 = list(map(int,input().strip('[]').split()))
x2 = list(map(int,input().strip('[]').split()))
MOD = input()
n1 = len(x1)
n2 = len(x2)
n = max(n1,n2)
res = [0]*n
if n1>n2:
    x2_new = [0]*(n1-n2)+x2
    x1_new = x1
elif n1==n2:
    x2_new = x2
    x1_new = x1
elif n1<n2:
    x2_new = x2
    x1_new = [0]*(n2-n1)+x1
if MOD == '*':
    res = mul(x1,x2,n1,n2)
for i in range(n):
    if MOD == '+':
        res[i] = x1_new[i]+x2_new[i]
    elif MOD =='-':
        res[i] = x1_new[i]-x2_new[i]

i = 0
while i < n:
    if res[i] == 0:
        res.pop(i)
        n -= 1  # 减小n的值以匹配更新后的列表长度
    else:
        break
str_res = ' '.join(str(number) for number in res)
print('['+str_res+']')

if __name__ == "__main__":
    # A = list(map(int, input().split()))
    # B = list(map(int, input().split()))
    A_line = input().replace(' ', ', ')
    B_line = input().replace(' ', ', ')
    A = eval(A_line)
    B = eval(B_line)
    adder =  input()
    max_len = max(len(A), len(B))
    A = [0]*(max_len - len(A)) + A
    B = [0]*(max_len - len(B)) + B

    if adder in "-":
        res = [str(A[i]-B[i]) for i in range(max_len)]
        while res[0] == "0":
            res.pop(0)
        print("["+" ".join(res)+"]")
    if adder in "+":
        res = [str(A[i]+B[i]) for i in range(max_len)]
        while res[0] == "0":
            res = res[1:]
        print("["+" ".join(res)+"]")
    elif adder in "*":
        res = [0]*(2*max_len - 2 + 1)
        for i in range(max_len):
            for j in range(max_len):
                rank = max_len - 1 - i + max_len - 1 - j
                idx = 2*(max_len-1) - rank
                # print(i, j, rank, idx)
                res[idx]+= A[i]*B[j]
            # print(res)
        while res[0] == 0:
            res = res[1:]
        print("["+" ".join([str(val) for val in res])+"]")

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

// 加法运算
vector<int> add(vector<int>& a, vector<int>& b) {
    int n = max(a.size(), b.size());
    vector<int> res(n, 0);
    // 将两个数组逐位相加
    for (int i = 0; i < n; i++) {
        if (i < a.size()) res[i] += a[i];
        if (i < b.size()) res[i] += b[i];
    }
    reverse(res.begin(), res.end());
    // 去除前导零
    while (res.size() > 1 && res[0] == 0) {
        res.erase(res.begin());
    }
    return res;
}

// 减法运算
vector<int> subtract(vector<int>& a, vector<int>& b) {
    int n = max(a.size(), b.size());
    vector<int> res(n, 0);
    // 将两个数组逐位相减
    for (int i = 0; i < n; i++) {
        if (i < a.size()) res[i] += a[i];
        if (i < b.size()) res[i] -= b[i];
    }
    reverse(res.begin(), res.end());
    // 去除前导零
    while (res.size() > 1 && res[0] == 0) {
        res.erase(res.begin());
    }
    return res;
}

// 乘法运算
vector<int> multiply(vector<int>& a, vector<int>& b) {
    int n = a.size() + b.size() - 1;
    vector<int> res(n, 0);
    // 双重循环模拟多项式乘法
    for (int i = 0; i < a.size(); i++) {
        for (int j = 0; j < b.size(); j++) {
            res[i + j] += a[i] * b[j];
        }
    }
    reverse(res.begin(), res.end());
    // 去除前导零
    while (res.size() > 1 && res[0] == 0) {
        res.erase(res.begin());
    }
    return res;
}

int main() {
    string s;
    getline(cin, s);
    stringstream ss(s.substr(1, s.length() - 2));
    vector<int> a;
    int x;
    while (ss >> x) a.push_back(x);
    reverse(a.begin(), a.end());

    getline(cin, s);
    ss.clear();
    ss.str(s.substr(1, s.length() - 2));
    vector<int> b;
    while (ss >> x) b.push_back(x);
    reverse(b.begin(), b.end());

    char op;
    cin >> op;

    vector<int> res;
    if (op == '+') res = add(a, b);
    else if (op == '-') res = subtract(a, b);
    else if (op == '*') res = multiply(a, b);

    // 输出结果并格式化为多项式的数组表示
    cout << "[";
    for (int i = 0; i < res.size(); i++) {
        if (i != 0) cout << " ";
        cout << res[i];
    }
    cout << "]" << endl;

    return 0;
}

def readIn ():
        x = list(map(int , input()[1:-1].split(' ')))
        y = list(map(int , input()[1:-1].split(' ')))
        return x , y
def solve(x):
        return x[::-1]
def mul (a , b , n , m):
        ans = [0] * (n + m - 1)
        for i in range(n):
                for j in range(m):
                        ans[i + j] += a[i] * b[j]
        return ans
        
a , b = readIn()
n = len(a)
m = len(b)
a = solve(a)
b = solve(b)
c = input()
ans = []
if c == '-':
        for i in range(max(n , m)):
                s = 0
                if i < n:
                        s += a[i]
                if i < m:
                        s -= b[i]
                ans.append(s)
                
if c == '*':
        ans = mul(a , b , n , m)
                        
if c == '+':
        for i in range(max(n , m)):
                s = 0
                if i < n:
                        s += a[i]
                if i < m:
                        s += b[i]
                ans.append(s)

def get(x):
        while len(x) > 1 and x[-1] == 0:
                x.pop()
        return x
        
ans = solve(get(ans))

output = "[" + " ".join(map(str , ans)) + "]"

print (output)

import java.util.*;

class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int[] a = parseInput(in.nextLine());
        int[] b = parseInput(in.nextLine());
        char op = in.nextLine().charAt(0);

        int[] result;
        if (op == '+') {
            result = add(a, b);
        } else if (op == '-') {
            result = subtract(a, b);
        } else {
            result = multiply(a, b);
        }

        System.out.print("[");
        boolean first = true;
        for (int num : result) {
            if (!first) System.out.print(" ");
            System.out.print(num);
            first = false;
        }
        System.out.println("]");
    }

    // 解析输入的数组字符串
    private static int[] parseInput(String s) {
        s = s.replace("[", "").replace("]", "");
        String[] tokens = s.split("\\s+");
        int[] arr = new int[tokens.length];
        for (int i = 0; i < tokens.length; i++) {
            arr[i] = Integer.parseInt(tokens[i]);
        }
        return reverse(arr);
    }

    // 反转数组
    private static int[] reverse(int[] arr) {
        for (int i = 0; i < arr.length / 2; i++) {
            int temp = arr[i];
            arr[i] = arr[arr.length - i - 1];
            arr[arr.length - i - 1] = temp;
        }
        return arr;
    }

    // 加法
    private static int[] add(int[] a, int[] b) {
        int maxLen = Math.max(a.length, b.length);
        int[] result = new int[maxLen];
        for (int i = 0; i < maxLen; i++) {
            result[i] = (i < a.length ? a[i] : 0) + (i < b.length ? b[i] : 0);
        }
        return reverse(trimLeadingZeros(result));
    }

    // 减法
    private static int[] subtract(int[] a, int[] b) {
        int maxLen = Math.max(a.length, b.length);
        int[] result = new int[maxLen];
        for (int i = 0; i < maxLen; i++) {
            result[i] = (i < a.length ? a[i] : 0) - (i < b.length ? b[i] : 0);
        }
        return reverse(trimLeadingZeros(result));
    }

    // 乘法
    private static int[] multiply(int[] a, int[] b) {
        int[] result = new int[a.length + b.length - 1];
        for (int i = 0; i < a.length; i++) {
            for (int j = 0; j < b.length; j++) {
                result[i + j] += a[i] * b[j];
            }
        }
        return reverse(trimLeadingZeros(result));
    }

    // 去除前导零
    private static int[] trimLeadingZeros(int[] arr) {
        int nonZeroIndex = 0;
        while (nonZeroIndex < arr.length - 1 && arr[nonZeroIndex] == 0) {
            nonZeroIndex++;
        }
        return Arrays.copyOfRange(arr, nonZeroIndex, arr.length);
    }
}