#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i,n) for(int i=0;i<n;i++)

const ll mod = ll(1e9) + 7;
const int INF = 1<<29;

int main(){
    int n,m;
    char op;
    cin >> n >> m >> op;
    vector<ll> a(n),b(m);
    rep(i,m) cin >> b[i];
    rep(i,n) cin >> a[i];
    vector<vector<ll>> ans(n,vector<ll>(m));
    rep(i,n){
        rep(j,m){
            if (op=='+') ans[i][j] = a[i] + b[j];
            else ans[i][j] = a[i] * b[j];
        }
    }
    rep(i,n){
        rep(j,m){
            if (j==m-1) cout << ans[i][j] << endl;
            else cout << ans[i][j] << ' ';
        }
    }
    return 0;
}