import std.stdio, std.string, std.conv, std.range; import std.algorithm, std.array, std.typecons, std.container; import std.math, std.numeric, std.random, core.bitop; enum inf = 1_001_001_001; enum infl = 1_001_001_001_001_001_001L; enum mod = 1_000_000_007L; void main() { int N, M; scan(N, M); auto dp = new long[][](N + 1, M + 1); auto Bs = readln.split.array; bool tasu = Bs[0] == "+"; Bs[0] = "0"; auto B = Bs.to!(long[]); auto A = iota(N).map!(i => readln.chomp.to!long).array; A = [0L] ~ A; dp[0][] = B; foreach (i ; 1 .. N + 1) { dp[i][0] = A[i]; } foreach (i ; 1 .. N + 1) { foreach (j ; 1 .. M + 1) { if (tasu) dp[i][j] = A[i] + B[j]; else dp[i][j] = A[i] * B[j]; } } foreach (i ; 1 .. N + 1) { writefln("%(%s %)", dp[i][1 .. $]); } } void scan(T...)(ref T args) { import std.stdio : readln; import std.algorithm : splitter; import std.conv : to; import std.range.primitives; auto line = readln().splitter(); foreach (ref arg; args) { arg = line.front.to!(typeof(arg)); line.popFront(); } assert(line.empty); } void fillAll(R, T)(ref R arr, T value) { static if (is(typeof(arr[] = value))) { arr[] = value; } else { foreach (ref e; arr) { fillAll(e, value); } } } bool chmin(T, U...)(ref T x, U args) { bool isChanged; foreach (arg; args) { if (x > arg) { x = arg; isChanged = true; } } return isChanged; } bool chmax(T, U...)(ref T x, U args) { bool isChanged; foreach (arg; args) { if (x < arg) { x = arg; isChanged = true; } } return isChanged; }