#include <bits/stdc++.h>
#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define ff first
#define ss second
#define dbg(x) cerr << #x << " = " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vvi = vt< vt<int> >;
const int N = 1e6 + 5, mod = 1e9 + 7, inf = 1e18 + 7, B = 500, LIM = (1ll << 60);
void solve () {
int n, k;
cin >> n >> k;
vt<int> a(n + 1), p(n + 1, 0);
for (int i = 1; i <= n; i++) cin >> a[i], p[i] = p[i - 1] + a[i];
partial_sum(all(p), p.begin());
int q;
cin >> q;
while (q--) {
int tp;
cin >> tp;
if (tp == 1) {
vt<int> pos(k + 1), v;
for (int i = 1; i <= k; i++) cin >> pos[i], v.pb(a[pos[i]]);
/*int x = v[0];
for (int i = 0; i < k - 1; i++) a[pos[i + 1]] = v[i + 1];
a[pos[k]] = x;
for (int i = 1; i <= n; i++) p[i] = p[i - 1] + a[i];
partial_sum(all(p), p.begin()); */
}
if (tp == 2) {
int l, r, m;
cin >> l >> r >> m;
int ans = p[r] - (p[r - m] + p[l + m - 2]) + (l - 2 >= 1 ? p[l - 2] : 0);
cout << ans << '\n';
}
}
cout << '\n';
}
bool testcases = 0;
signed main() {
cin.tie(0) -> sync_with_stdio(0);
int test = 1;
if (testcases) cin >> test;
for (int cs = 1; cs <= test; cs++) {
solve();
}
}
