//srand(time(0)) - always changing //order_of_key(k): Number of items strictly smaller than k . //find_by_order(k): K-th element in a set (counting from zero). //#pragma GCC optimize("O3,unroll-loops") //#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt") #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> #define fopen(s) freopen(s".in","r",stdin);freopen(s".out","w",stdout) #define all(x) (x).begin(), (x).end() #define len(x) (int)x.size() #define pb push_back #define pf push_front #define popb pop_back #define popf pop_front #define elif else if #define F first #define S second #define int long long typedef unsigned long long ull; typedef long long ll; using namespace std; using namespace __gnu_pbds; const int MOD = 1e9 + 7; const int N = 2e5 + 7; const int P = 911; const ll INF = 1e18; int gcd(int a, int b) { while (b) { a %= b; swap (a, b); } return a; } ll __sqrt(ll x) { ll result = 0; for (ll k = 1ll << 30; k != 0; k >>= 1) { if ((result + k) * (result + k) <= x) { result += k; } } return result; } int a[N], ty, l, r, m; int solve2() { int ans = 0; for (int i = l; i <= r; i++) { if (i + m - 1 > r) break; for (int j = i; j <= i + m - 1; j++) { ans += a[j]; } } return ans; } void solve() { int n, k; cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> a[i]; } int q; cin >> q; while (q--) { cin >> ty >> l >> r >> m; if (ty == 2) cout << solve2(); } } const bool Cases = 0; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int TT = 1; if (Cases) cin >> TT; while (TT--) { solve(); } }