#include<iostream>
#include<cstdio>
#include<algorithm>using namespace std;
const int N=100010;int n,m;
int a[N];inline int read()
{int x=0;int f=1;char c=getchar();while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9')x=x*10+c-'0',c=getchar();return x*f;
}
int main()
{freopen("XTTMYXJ.in","r",stdin);freopen("XTTMYXJ.out","w",stdout); n=read();m=read();for(int i=1;i<=n;i++)a[i]=read();for(int i=1;i<=m;i++){int start=read(),endd=read(),jump=read();long long answer=0;for(int i=start;i<=min(n,endd);i+=jump)answer+=a[i];printf("%lld\n",answer);}return 0;
}

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>using namespace std;
#define ll long longinline int read()
{int x=0;int f=1;char c=getchar();while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9')x=x*10+c-'0',c=getchar();return x*f;
}const ll maxn=101000;ll n,m,size;
ll block[maxn],c[maxn],sum[400][maxn];ll query_1(ll l,ll r,ll jump)
{ll ans=0;for(ll i=l;i<=r;i+=jump) ans+=c[i];return ans;
}ll query_2(ll l,ll r,ll jump)
{r=r-((r-l)%jump);if(r<=l) return c[l];return sum[jump][l]-sum[jump][r+jump];
}int main()
{freopen("XTTMYXJ.in","r",stdin);freopen("XTTMYXJ.out","w",stdout);n=read(),m=read(),size=sqrt(n);for(ll i=1;i<=n;i++) block[i]=(i-1)/size+1;for(ll i=1;i<=n;i++) c[i]=read();for(ll i=1;i<=size;i++)for(ll j=n;j>=1;j--)sum[i][j]=sum[i][j+i]+c[j];for(ll i=1;i<=m;i++){ll l=read(),r=read(),jump=read();if(jump==0) printf("%lld\n",c[l]);else if(jump>size) printf("%lld\n",query_1(l,r,jump));//1步大于块数 else printf("%lld\n",query_2(l,r,jump));//一步小于块数 }return 0;
}