#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define N 100080
#define lowbit(x) (x&-x)
using namespace std;
int c1[N],c2[N],H[N],D[N],n,q;
void addq(int* c,int x,int d)
{
	while(x>0)
	{
		c[x]+=d;
		x-=lowbit(x);
	}
}
int que(int* c,int x)
{
	int ans=0;
	while(x<=n)
	{
		ans+=c[x];
		x+=lowbit(x);
	}
	return ans;
}
void work()
{
	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,l,r,d;
	for(int i=1;i<=q;i++)
	{
		scanf("%d",&a);
		if(!a)
		{
			scanf("%d%d%d",&l,&r,&d);
			addq(c1,r,d);
			addq(c1,l-1,-d);
			addq(c2,r,1);
			addq(c2,l-1,-1);
		}
		else
		{
			for(int i=1;i<=n;i++)
				printf("%d ",H[i]-que(c1,i)+que(c2,i)*D[i]);
			printf("\n");
		}
	}
}
int main()
{
	freopen("thebigmatch.in","r",stdin);
	freopen("thebigmatch.out","w",stdout);
	work();
	return 0;
}