#include <iostream>
#include <vector>
using namespace std;
// Function to calculate the sum of subsequences using a sliding window
long long sum_of_subsequences(vector<int>& A, int l, int r, int m) {
long long current_sum = 0;
long long result = 0;
// Calculate initial window sum
for (int i = l; i < l + m; ++i) {
current_sum += A[i];
}
result += current_sum;
// Slide the window across the range [l, r]
for (int i = l + 1; i <= r - m + 1; ++i) {
current_sum = current_sum - A[i - 1] + A[i + m - 1];
result += current_sum;
}
return result;
}
int main() {
int N, Q;
cin >> N >> Q;
vector<int> A(N + 1); // Use 1-based indexing for simplicity
for (int i = 1; i <= N; ++i) {
cin >> A[i];
}
while (Q--) {
int type;
cin >> type;
if (type == 1) {
int idx, value;
cin >> idx >> value;
A[idx] = value; // Direct update
} else if (type == 2) {
int l, r, m;
cin >> l >> r >> m;
cout << sum_of_subsequences(A, l, r, m) << endl;
}
}
return 0;
}
