//#include <atcoder/all>
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
using namespace std;
//using namespace atcoder;
using ll = long long;
#define all(A) A.begin(),A.end()
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
ll Max(ll(a), ll(b), ll(c)) {
	return max(max(a, b), c);
}
ll Min(ll(a), ll(b), ll(c)) {
	return min(min(a, b), c);
}

void aN(bool ch) {
	if (ch)cout << "Yes" << endl;
	else cout << "No" << endl;
	return;
}


int main() {
	ll N,M;
	char op;
	cin >> N>>M>>op;
	vector<ll> B(M);
	vector<ll> A(N);
	rep(i, M) {
		cin >> B[i];
	}
	rep(i, N) {
		cin >> A[i];
	}
	if (op == '+') {
		rep(n, N) {
			rep(m, M) {
				cout << A[n] + B[m] << " ";
			}
			cout << endl;
		}
	}
	else {
		rep(n, N) {
			rep(m, M) {
				cout << A[n] * B[m] << " ";
			}
			cout << endl;
		}
	}
}