#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define REP(i, n) for(ll i = 0;i < n;i++) #define REPR(i, n) for(ll i = n;i >= 0;i--) #define FOR(i, m, n) for(ll i = m;i < n;i++) #define FORR(i, m, n) for(ll i = m;i >= n;i--) #define REPO(i, n) for(ll i = 1;i <= n;i++) #define ll long long #define INF (ll)1 << 60 #define MINF (-1 * INF) #define ALL(n) n.begin(),n.end() #define MOD 1000000007 #define P pair ll a[11000], b[11000], n, m; char c; int main() { cin >> n >> m >> c; REP(i, m)cin >> b[i]; REP(i, n)cin >> a[i]; REP(i, n) { REP(j, m) { if (j != 0)cout << " "; if(c == '*')cout << a[i] * b[j]; else cout << a[i] + b[j]; } cout << endl; } }