#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve(){
int n, k; cin >> n >> k;
vector<int> v(n), pref(n+1);
for (int i = 0; i < n; i++){
cin >> v[i];
pref[i+1] = pref[i] + v[i];
}
int q; cin >> q;
for (int i =0 ; i < q; i++){
int p; cin >> p;
if (p == 1){
vector<int> vk(k);
for (int j = 0; j < k; j++) cin >> vk[j];
}
if (p == 2){
int l, r, m; cin >> l >> r >> m;
int cnt = 0;
for (int j = 0; j <= r - l - m + 1; j++){
// if (l + j > r - j) break;
cnt += pref[l + j + m - 1] - pref[l + j - 1];
// cout << l + j + m - 1 << ' ' << l + j - 1 << endl;
}
cout << cnt << endl;
}
}
}
signed main(){
ios_base::sync_with_stdio(0);
int t = 1;
// cin >> t;
while (t--)solve();
}
