//Judges with GCC >= 12 only needs Ofast
//#pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
//MLE optimization
//#pragma GCC optimize("conserve-stack")
//Old judges
//#pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
//New judges. Test with assert(__builtin_cpu_supports("avx2"));
//#pragma GCC target("arch=skylake")
//Atcoder
//#pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
//template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//write variables and debug
#define bugf cout << "Here" << endl
#define bug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#define bugarr(arr,...) cout << #arr; _dbg_arr(arr, __VA_ARGS__)
template<class T, class U>
ostream& operator<<(ostream& output, const pair<T, U> &A){
output << "(" << A.first << ", " << A.second << ")";
return output;
}
template <class T>
ostream& operator<<(ostream& output, const vector<T> &arr){
int n = arr.size();
output << "[";
for(int i = 0; i < n; i++){
output << arr[i];
if(i != n - 1) output << ", ";
}
output << "]";
return output;
}
template<class T>
ostream& operator<<(ostream& output, const set<T> &s){
output << "{";
for(auto it = s.begin(); it != s.end(); it++){
if(it != s.begin()) output << ", ";
output << (*it);
}
output << "}";
return output;
}
template<class T, class U>
ostream& operator<<(ostream& output, const map<T, U> &m){
output << "{";
for(auto it = m.begin(); it != m.end(); it++){
if(it != m.begin()) output << ", ";
output << "(" << it->first << " : " << it->second << ")";
}
output << "}";
return output;
}
template<class TH>
void _dbg(const char *sdbg, TH h){
cout << sdbg << " = " << h << endl;
}
template<class TH, class... TA>
void _dbg(const char *sdbg, TH h, TA... a) {
while(*sdbg != ',')cout << *sdbg++;
cout << " = " << h << "\n";
_dbg(sdbg+1, a...);
}
template<class _Arr, class _Index>
void _dbg_arr(_Arr arr, _Index index){
cout << '[' << index << "] = " << arr[index] << endl;
}
template<class _Arr, class _Index, class... TA>
void _dbg_arr(_Arr &arr, _Index index, TA... args){
cout << '[' << index << ']';
_dbg_arr(arr[index], args...);
}
//open file
#define taskname "" //name input and output file
#ifdef SteGG
void open(){
if(fopen("input.inp", "r")){
freopen("input.inp", "r", stdin);
freopen("output.out", "w", stdout);
}
}
#else
void open(){
if(fopen(taskname".inp", "r")){
freopen(taskname".inp", "r", stdin);
freopen(taskname".out", "w", stdout);
}
}
#endif
//initialize
#define testcase \
long long test; \
cin >> test; \
for(int tst = 1; tst <= test; tst++)
#define int long long
#define MOD 1000000007
#define FFTMOD (119 << 23 | 1)
#define EPSILON 1e-9
#define setpre(x) fixed << setprecision(x)
#define cd complex<double>
#define all(x) x.begin(), x.end()
const long long INF = 3e18L + 5;
const int inf = 1e9 + 7;
const double infd = 1e60;
const double PI = acos(-1);
const int maxn = 1e5 + 5;
//const int base = ;
int n, k;
int arr[maxn];
int q;
int bit[maxn];
int change[11];
//others struct or class
//others function
//others init
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
open();
cin >> n >> k;
for(int i = 1; i <= n; i++){
cin >> arr[i];
}
auto update = [&](int p, int v){
for(; p <= n; p += p & (-p)){
bit[p] += v;
}
};
auto get = [&](int p){
int result = 0;
for(; p > 0; p -= p & (-p)){
result += bit[p];
}
return result;
};
auto range = [&](int l, int r){
return get(r) - get(l - 1);
};
for(int i = 1; i <= n; i++){
update(i, arr[i]);
}
cin >> q;
while(q--){
int type;
cin >> type;
if(type == 1){
for(int i = 1; i <= k; i++){
cin >> change[i];
}
int first = arr[change[1]];
for(int i = 2; i <= k; i++){
// bug(range(change[i - 1], change[i - 1]));
update(change[i - 1], -arr[change[i - 1]]);
// bug(range(change[i - 1], change[i - 1]));
update(change[i - 1], arr[change[i]]);
// bug(range(change[i - 1], change[i - 1]));
arr[change[i - 1]] = arr[change[i]];
}
update(change[k], -arr[change[k]]);
update(change[k], first);
arr[change[k]] = first;
}else{
int l, r, m;
cin >> l >> r >> m;
int len = r - l + 1;
int limit = 512;
if(m > limit){
int result = 0;
for(int i = l; i <= r - m + 1; i++){
result += range(i, i + m - 1);
}
cout << result << endl;
}else{
int ptr_m = 1;
int result = 0;
while(ptr_m < m){
result += (arr[l] + arr[r]) * ptr_m;
ptr_m++;
l++, r--;
}
result += range(l, r) * m;
cout << result << endl;
}
}
}
return 0;
}
