RT

#include <bits/stdc++.h>
using namespace std;
const int N = 100000;
long long t[N << 2], d[N << 2], a[N + 5];
void add(int x, long long v, int L, int R){
	t[x] += v * (R - L + 1);
	d[x] += v;
	return;
}
void pushup(int x){
	t[x] = t[x << 1] + t[x << 1 | 1];
	return;
}
void pushdown(int x, int L, int R){
	if (!d[x]){
		return;
	}
	int mid = (L + R) >> 1;
	add(x << 1, d[x], L, mid);
	add(x << 1 | 1, d[x], mid + 1, R);
	pushup(x);
	return;
}
void build(int x, int L, int R){
	if (L == R){
		t[x] = a[L];
		return;
	}
	int mid = (L + R) >> 1;
	build(x << 1, L, mid);
	build(x << 1 | 1, mid + 1, R);
	pushup(x);
	return;
}
void change(int x, int l, int r, long long v, int L, int R){
	if (l == L && r == R){
		add(x, v, L, R);
		return;
	}
	pushdown(x, L, R);
	int mid = (L + R) >> 1;
	if (r <= mid){
		change(x << 1, l, r, v, L, mid);
	} else if (l > mid){
		change(x << 1 | 1, l, r, v, mid + 1, R);
	} else {
		change(x << 1, l, mid, v, L, mid);
		change(x << 1 | 1, mid + 1, r, v, mid + 1, R);
	}
	pushup(x);
	return;
}
long long query(int x, int l, int r, int L, int R){
	if (l == L && r == R){
		return t[x];
	}
	pushdown(x, L, R);
	int mid = (L + R) >> 1;
	if (r <= mid){
		return query(x << 1, l, r, L, mid);
	} else if (l > mid){
		return query(x << 1 | 1, l, r, mid + 1, R);
	} else {
		return query(x << 1, l, mid, L, mid) + query(x << 1 | 1, mid + 1, r, mid + 1, R);
	}
}
int main(){
	int n, m, op, l, r, k, d, p;
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++){
		scanf("%lld", &a[i]);
	}
    for (int i = n; i >= 1; i--){
		a[i] -= a[i - 1];
    }
	build(1, 1, n);
	while (m--){
		scanf("%d", &op);
		if (op == 1){
			scanf("%d%d%d%d", &l, &r, &k, &d);
			change(1, l, l, k, 1, n);
			if (l < r){
				change(1, l + 1, r, d, 1, n);
			}
			if (r < n){
				change(1, r + 1, r + 1, -(k + (r - l) * d), 1, n);
			}
		} else if (op == 2){
			scanf("%d", &p);
			printf("%lld\n", query(1, 1, p, 1, n));
		}
	}
	return 0;
}