#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#include <stack>

using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define all(A) A.begin(), A.end()
#define itr(A, l, r) A.begin() + l, A.begin() + r
#define debug(var) cout << #var << " = " << var << endl;
typedef long long ll;

int main(void)
{
    int n, m;
    cin >> n >> m;
    char op;
    cin >> op;
    vector<ll> b(m);
    rep(i, m)
    {
        cin >> b[i];
    }
    vector<ll> a(n);
    rep(i, n)
    {
        cin >> a[i];
    }
    rep(i, n)
    {
        vector<ll> tmp;
        rep(j, m)
        {
            if (op == '+')
            {
                tmp.push_back(a[i] + b[j]);
            }
            else
            {
                tmp.push_back(a[i] * b[j]);
            }
        }
        auto print_join = [](auto v)
        {
            int size = v.size();
            rep(i, size)
            {
                if (i < size - 1)
                {
                    cout << v[i] << ' ';
                }
                else
                {
                    cout << v[i] << endl;
                }
            }
        };
        print_join(tmp);
    }
}