#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
const int maxn = 1e5 + 1;
int n, k, a[maxn];
unsigned long long p[maxn], pref[maxn];
void solve(){
int q;
cin >> q;
while(q--){
int type;
cin >> type;
if(type == 1){
for(int i = 0;i < k;i++){
int a;
cin >> a;
}
continue;
}
int l, r, m;
cin >> l >> r >> m;
unsigned long long ans = 0;
ans = pref[r] - pref[l + m - 2];
ans = ans - (pref[r - m] - pref[max(0, l - 2)]);
cout << ans << endl;
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
for(int i = 1;i <= n;i++){
cin >> a[i];
p[i] = p[i - 1] + a[i];
}
for(int i = 1;i <= n;i++){
pref[i] = pref[i - 1] + p[i];
}
solve();
return 0;
}
