Codeforces Round #551 (Div. 2) B. Serval and Toy Bricks

Codeforces Round #551 (Div. 2) B. Serval and Toy Bricks

#include<bits/stdc++.h>
using namespace std;

int main()
{
	int n,m,h;cin>>n>>m>>h;
	vector<int> a(m+1);
	for(int i=1;i<=m;i++) cin>>a[i];
	
	vector<int> b(n+1);
	for(int i=1;i<=n;i++) cin>>b[i];
	
	vector<vector<int>> t(n+1,vector<int>(m+1));
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			cin>>t[i][j];
	
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			if(t[i][j])
				t[i][j]=min(b[i],a[j]);
	
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
			cout<<t[i][j]<<" ";
		cout<<endl;
	}
	
	return 0;
}