#include <cstdio>
using namespace std;
int n,m;
int a[100005];
namespace Baoli{
	void Work(){
		int l,r,jump;
        while(m--){
			scanf("%d%d%d",&l,&r,&jump);
			long long ans=0;
			for(int i=l;i<=r;i+=jump){
				ans+=a[i];
			}
			printf("%lld\n",ans);
		}
	}
};
int main(){
	freopen("XTTMYXJ.in","r",stdin);freopen("XTTMYXJ.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	if(n<=2000)Baoli::Work();
}
/*
P.S : 我右边的人告诉了我分块大法好，然而我并不会打，TAT，详情请戳stdafx.tk
*/