MOD = 10 ** 9 + 7
INF = 10 ** 10
import sys
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)
from collections import deque

def main():
    n,m = map(int,input().split())
    s = input().split()
    b = [int(s[i]) for i in range(1,m + 1)]
    a = [int(input()) for _ in range(n)]
    ans = [[0] * m for _ in range(n)]
    if s[0] == '+':
        for i in range(n):
            for j in range(m):
                ans[i][j] = a[i] + b[j]
    
    else:
        for i in range(n):
            for j in range(m):
                ans[i][j] = a[i] * b[j]
    
    for i in range(n):
        print(*ans[i])
        
if __name__ =='__main__':
    main()