/*
██████╗ █████╗ ███████╗██╗ ██╗██╗██████╗
██╔══██╗██╔══██╗██╔════╝██║ ██║██║██╔══██╗
██████╔╝███████║███████╗███████║██║██║ ██║
██╔══██╗██╔══██║╚════██║██╔══██║██║██║ ██║
██║ ██║██║ ██║███████║██║ ██║██║██████╔╝
╚═╝ ╚═╝╚═╝ ╚═╝╚══════╝╚═╝ ╚═╝╚═╝╚═════╝
*/
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define ull unsigned long long
#define ld long double
#define str string
#define ch char
#define db double
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define YES cout<<"YES\n";
#define NO cout<<"NO\n";
#define Bob cout<<"Bob\n";
#define Alice cout<<"Alice\n";
#define ordered_set tree<pair<ll, ll>, null_type,less<pair<ll,ll>>,rb_tree_tag,tree_order_statistics_node_update>
const ll MOD=1e9+7;
const ll INF = 10000000000;
void solve(){
ll n,k;
cin>>n>>k;
vector<ll>v(n+1);
vector<ll>pref(n+1);
for(ll i = 1;i<=n;i++){
cin>>v[i];
pref[i]=pref[i-1]+v[i];
}
ll q;
cin>>q;
while(q--){
ll a;
cin>>a;
if(a==1){
ll b;
cin>>b;
}
else{
ll l,r,m;
cin>>l>>r>>m;
ll ans = 0;
for(ll i = l;i+m-1<=r;i++){
ll alma = pref[i+m-1]-pref[i-1];
ans+=alma;
}
cout<<ans<<"\n";
}
}
}
signed main(){
ll t=1;
//cin>>t;
while(t--){
solve();
}
return 0;
}
