#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include <map>
#include <string>
#include <cmath>
#include <algorithm>
#include <queue>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repe(i,x,n) for(int i=x; i<(n); ++i)
using ll = long long;
using P = pair<int, int>;
#define pai 3.1415926535897932384
#define INF 100100100
#define _GLIBCXX_DEBUG

int main() {
    
    ll N,M;
    char S;
    cin >> N >> M >> S;
    vector<ll> A(N);
    vector<ll> B(M);
    rep(i,M) {
        cin >> B[i];
    }
    rep(i,N) {
        cin >> A[i];
    }
    if(S == '+') {
        rep(i,N)rep(j,M) {
            if(j == M-1) {
                cout << A[i]+B[j] << endl;
            }
            else { 
                cout << A[i]+B[j] << " ";
            }
        }
        return 0;
    }
    else {
        rep(i,N)rep(j,M) {
            if(j == M-1) {
                cout << A[i]*B[j] << endl;
            }
            else {
                cout << A[i]*B[j] << " ";
            }
        }
        return 0;
    }

}