#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=100010;
int n,q;
long long H[maxn],D[maxn],cnt[maxn],cq[maxn];
int main()
{
	freopen("thebigmatch.in","r",stdin);
	freopen("thebigmatch.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	scanf("%d",&H[i]);
	for(int i=1;i<=n;i++)
	scanf("%d",&D[i]);
	scanf("%d",&q);
	int a;
	while(q--)
	{
		scanf("%d",&a);
		if(a==1)
		{
			int sum_cnt=0,sum_cq=0;
			for(int i=1;i<=n;i++)
			{
				sum_cnt+=cnt[i];
				sum_cq+=cq[i];
				printf("%lld ",H[i]-sum_cq+sum_cnt*D[i]);
			}
			printf("\n");
		}
		else
		{
			int k,i,j;
			scanf("%d%d%d",&i,&j,&k);
			cq[i]+=k;
			cnt[i]+=1;
			cq[j+1]-=k;
			cnt[j+1]-=1;
		}
	}
	return 0;
}