#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

typedef long long ll;

#define MOD 1000000007

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