#include<bits/stdc++.h>
using namespace std;
#define task "task"
#define ii pair<int,int>
#define fi first
#define se second
#define int long long
#define ll long long
#define ld double
#define mp make_pair
#define lg2 30
#define iii pair<int,ii>
#define iiii pair<ii,ii>
#define base 29
#define eps 1e-8
int dx[]= {0LL,0LL,1,-1,1,1,-1,-1};
int dy[]= {1,-1,0LL,0LL,1,-1,1,-1};
const int maxn=1e5+5;
const int mod=1e9+7;
int n,a[maxn],tree[4*maxn],s[maxn],q,lazy[4*maxn],k,id[15];
void build(int id=1,int l=0,int r=n)
{
if(l==r)
{
tree[id]=s[l];
return;
}
int mid=(l+r)/2;
build(id*2,l,mid);
build(id*2+1,mid+1,r);
tree[id]=tree[id*2]+tree[id*2+1];
}
void down(int id,int l,int r)
{
int mid=(l+r)/2;
tree[id*2]+=(mid-l+1)*lazy[id];
tree[id*2+1]+=(r-mid)*lazy[id];
lazy[id*2]+=lazy[id];
lazy[id*2+1]+=lazy[id];
lazy[id]=0;
}
void update(int u,int v,int val,int id=1,int l=0,int r=n)
{
if(u>r||v<l)return;
if(u<=l&&v>=r)
{
tree[id]+=(r-l+1)*val;
lazy[id]+=val;
return;
}
down(id,l,r);
int mid=(l+r)/2;
update(u,v,val,id*2,l,mid);
update(u,v,val,id*2+1,mid+1,r);
tree[id]=tree[id*2]+tree[id*2+1];
}
int get(int u,int v,int id=1,int l=0,int r=n)
{
if(u>r||v<l)return 0;
if(u<=l&&v>=r)return tree[id];
int mid=(l+r)/2;
down(id,l,r);
return get(u,v,id*2,l,mid)+get(u,v,id*2+1,mid+1,r);
}
void init()
{
cin>>n>>k;
for(int i=1;i<=n;i++)
{
cin>>a[i];
s[i]=s[i-1]+a[i];
}
cin>>q;
build();
}
void process()
{
while(q--)
{
int t;cin>>t;
if(t==1)
{
for(int i=1;i<=k;i++)cin>>id[i];
id[k+1]=id[1];
for(int i=1;i<=k;i++)
{
update(id[i],n,-a[id[i]]+a[id[i+1]]);
}
int val=a[id[1]];
for(int i=1;i<k;i++)a[id[i]]=a[id[i]+1];
a[id[k]]=val;
}
else
{
int l,r,m;
cin>>l>>r>>m;
cout<<get(l+m-1,r)-get(l-1,r-m)<<'\n';
}
}
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
if(fopen(task".inp","r"))
{
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
init();
process();
cerr <<endl<< "TIME : " << clock() * 0.001 << "s" << endl ;
}
