#include <cstdio>
#include <algorithm>
#include <cstring>
#define M 100005
using namespace std;
typedef long long L;

int n, q;
L H[M], D[M], num[M], K[M];

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);
	
	while(q--)
	{
		int x; scanf("%d", &x);
		if(x)
		{
			for(int i = 1; i <= n; i++) 
			{
				num[i] += num[i-1], K[i] += K[i-1];
				printf("%lld ", H[i]-=(K[i]-D[i]*num[i]));
			}
			putchar('\n');
			memset(  K, 0, sizeof   K);
			memset(num, 0, sizeof num);
		}
		else
		{
			int a, b; L c; scanf("%d %d %lld", &a, &b, &c);
			K[a] += c, K[b+1] -= c;
			num[a] ++, num[b+1] --;
		}
	}
	return 0;
}