#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
int m,n;
long long sum[110000];
int num;
struct pop
{
	int xx,yy;
}a[110000];
/*void aa(int z,int x,int y)
{
	if(x==y)return;
	a[z].xx=x;
	a[z].yy=y;
	aa(z*2,x,(x+y)/2);
	aa(z*2,(x+y)/2+1,y);
}
void Q(int x,int y,int z)
{
	int midd,zuo=a[z].xx,you=a[z].yy;
	midd=(zuo+you)/2;
	if(x==zuo&&y==you){num=num+sum[z];return 0;}
	if(x>midd)Q(midd+1,y,z*2+1);
	if(y<=midd)Q(x,midd,z*2);
	if(x<=midd&&y>midd){Q(midd+1,y,z*2+1);Q(x,midd,z*2);}
}*/
void init()
{
	int o,p,l,k;
	char kk;
	cin>>m>>n;
	for(int i=1;i<=m;i++)
	{cin>>o;sum[i]=sum[i-1]+o;}
	for(int i=1;i<=n;i++)
	{	cin>>kk>>p>>l>>k;cout<<sum[max(l,p)]-sum[min(l,p)-1]<<endl;}
}
int main()
{
	freopen("cdcq_a.in","r",stdin);
	freopen("cdcq_a.out","w",stdout);
	init();
	return 0;
}