Serval and Toy Bricks (还原三视图)

B. Serval and Toy Bricks

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Luckily, Serval got onto the right bus, and he came to the kindergarten on time. After coming to kindergarten, he found the toy bricks very funny.

He has a special interest to create difficult problems for others to solve. This time, with many 1×1×11×1×1 toy bricks, he builds up a 3-dimensional object. We can describe this object with a n×mn×m matrix, such that in each cell (i,j)(i,j), there are hi,jhi,j bricks standing on the top of each other.

However, Serval doesn't give you any hi,jhi,j, and just give you the front view, left view, and the top view of this object, and he is now asking you to restore the object. Note that in the front view, there are mm columns, and in the ii-th of them, the height is the maximum of h1,i,h2,i,…,hn,ih1,i,h2,i,…,hn,i. It is similar for the left view, where there are nn columns. And in the top view, there is an n×mn×m matrix ti,jti,j, where ti,jti,j is 00 or 11. If ti,jti,j equals 11, that means hi,j>0hi,j>0, otherwise, hi,j=0hi,j=0.

However, Serval is very lonely because others are bored about his unsolvable problems before, and refused to solve this one, although this time he promises there will be at least one object satisfying all the views. As his best friend, can you have a try?

Input

The first line contains three positive space-separated integers n,m,hn,m,h (1≤n,m,h≤1001≤n,m,h≤100) — the length, width and height.

The second line contains mm non-negative space-separated integers a1,a2,…,ama1,a2,…,am, where aiai is the height in the ii-th column from left to right of the front view (0≤ai≤h0≤ai≤h).

The third line contains nn non-negative space-separated integers b1,b2,…,bnb1,b2,…,bn (0≤bj≤h0≤bj≤h), where bjbj is the height in the jj-th column from left to right of the left view.

Each of the following nn lines contains mm numbers, each is 00 or 11, representing the top view, where jj-th number of ii-th row is 11 if hi,j>0hi,j>0, and 00 otherwise.

It is guaranteed that there is at least one structure satisfying the input.

Output

Output nn lines, each of them contains mm integers, the jj-th number in the ii-th line should be equal to the height in the corresponding position of the top view. If there are several objects satisfying the views, output any one of them.

Examples

input

Copy

3 7 3
2 3 0 0 2 0 1
2 1 3
1 0 0 0 1 0 0
0 0 0 0 0 0 1
1 1 0 0 0 0 0

output

Copy

1 0 0 0 2 0 0
0 0 0 0 0 0 1
2 3 0 0 0 0 0

input

Copy

4 5 5
3 5 2 0 4
4 2 5 4
0 0 0 0 1
1 0 1 0 0
0 1 0 0 0
1 1 1 0 0

output

Copy

0 0 0 0 4
1 0 2 0 0
0 5 0 0 0
3 4 1 0 0

题目大意：给出了左视图，俯视图，和正视图，要求还原原来的形状。

 

对于某一行某一列，我们既要满足正视图又要满足左视图，所以取两者之间最小的即可。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<vector>
#include<cmath>
#include<bitset>
#include<algorithm>
#include<map>
using namespace std;
#define LL long long
#define N 300005
#define maxn 200005
#define inf 0x3f3f3f3f
#define sca(x) scanf("%d",&x)
#define fir first
#define sec second
#define mp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define N 105

int a[N],b[N],c[N][N];
int main()
{
    int n,m,h;
    cin>>n>>m>>h;
    for(int i=1; i<=m; i++)
    {
        sca(a[i]);
    }
    for(int i=1; i<=n; i++)
    {
        sca(b[i]);
    }

    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=m; j++)
        {
            sca(c[i][j]);
        }
    }


    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=m; j++)
        {
            if(c[i][j]==1)
            {
                c[i][j]=min(b[i],a[j]);
            }
            cout<<c[i][j];
            if(j==m)cout<<endl;
            else cout<<" ";
        }
    }
}