#include <iostream>
using namespace std;
#define int long long
const int N = 1e5 + 10;
int a[N]; 
struct seg { int sum, tag_f, tag_d; } s[N << 2];
void pushup(int u)
{
	int ls = u << 1, rs = u << 1 | 1;
	s[u].sum = s[ls].sum + s[rs].sum; 
}
void build(int u, int l, int r)
{
	if (l == r) { s[u].sum = a[l]; return ; }
	int mid = (l + r) / 2, ls = u << 1, rs = u << 1 | 1;
	build(ls, l, mid); build(rs, mid + 1, r);
	pushup(u);
}
int S(int f, int d, int len) { return f * len + len * (len - 1) / 2 * d; }
void maketag(int u, int l, int r, int x, int y)
{
	s[u].sum += S(x, y, r - l + 1);
	s[u].tag_f += x; s[u].tag_d += y;
}
void pushdown(int u, int l, int r)
{
	int mid = (l + r) / 2, ls = u << 1, rs = u << 1 | 1;
	maketag(ls, l, mid, s[u].tag_f, s[u].tag_d);
	maketag(rs, mid + 1, r, s[u].tag_f + (mid - l + 1) * s[u].tag_d, s[u].tag_d);
	s[u].tag_f = 0; s[u].tag_d = 0;
}
int query(int L, int R, int p, int u)
{
	if (L == R) return s[u].sum;
	pushdown(u, L, R);
	int mid = (L + R) / 2;
	if (p <= mid) return query(L, mid, p, u << 1);
	else return query(mid + 1, R, p, u << 1 | 1);
}
void update(int L, int R, int l, int r, int x, int y, int u)
{
	if (l <= L && R <= r) maketag(u, L, R, x, y);
	else if (L <= r && l <= R)
	{
		int mid = (L + R) / 2, ls = u << 1, rs = u << 1 | 1;
		pushdown(u, L, R);
		update(L, mid, l, r, x, y, ls); update(mid + 1, R, l, r, x + (mid - l + 1) * y, y, rs);
		pushup(u);
	}
}
signed main()
{
	int n, q;
	cin >> n >> q;
	for (int i = 1; i <= n; i++) cin >> a[i];
	build(1, 1, n);
	while (q--)
	{
		int op, l, r, k, d;
		cin >> op;
		if (op == 1)
		{
			cin >> l >> r >> k >> d;
			update(1, n, l, r, k, d, 1);
		}
		else
		{
			cin >> l;
			cout << query(1, n, l, 1) << endl;
		}
	}
	return 0;
}