#include <iostream>
#include <fstream>
#include <iomanip>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <ctime>
#include <algorithm>
#include <sstream>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <cstdlib>
#include <cstdio>
#include <iterator>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <stdio.h>
#include <bitset>
#include <cstdint>
#include <cassert>
#include <functional>
#include <complex>
#include <random>
#define ll long long
#define pb push_back
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ld long double
const ll maxn = 1e6 + 1, maxm = 1e6 + 1, maxk = 51;
const ll mod = 1e9 + 7, cmod = 998244353, inf = 1e9, block = 600, pp2 = 31;
const ld eps = 1e-9;
int main(){
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; ++i){
cin >> a[i];
}
int q;
cin >> q;
for (int i = 1; i <= q; ++i){
int type;
cin >> type;
if (type == 1){
int x;
cin >> x;
}
else{
int l, r, m;
cin >> l >> r >> m;
ll ans = 0;
for (int j = l; j <= r; ++j){
ans = (ans + min({j - l + 1, r - j + 1, m}) * 1ll * a[j]);
}
cout << ans << '\n';
}
}
}
