This documentation is automatically generated by online-judge-tools/verification-helper
#define PROBLEM "https://judge.yosupo.jp/problem/static_range_sum"
#include "../template/template.hpp"
#include "../data-structure/cumulative-sum.hpp"
int main(){
int N, Q;
cin >> N >> Q;
VL a = input(N);
CumulativeSum<ll> cs(a);
REP(i,Q){
int l, r;
cin >> l >> r;
cout << cs.get(l, r) << endl;
}
}
#line 1 "verify/LC-StaticRangeSum.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/static_range_sum"
#line 1 "template/template.hpp"
#include<bits/stdc++.h>
using ll = long long;
#define REP(i, n) for(ll i = 0; (i) < ll(n); ++ (i))
#define FOR(i, m, n) for(ll i = (m); (i) <= ll(n); ++ (i))
#define REPR(i, n) for(ll i = ll(n) - 1; (i) >= 0; -- (i))
#define FORR(i, m, n) for(ll i = ll(n); (i) >= ll(m); -- (i))
#define ALL(x) x.begin(),x.end()
#define INF (int)1e9
#define LLINF (long long)1e18
#define MOD (int)(1e9+7)
#define MOD9 (int)998244353
#define PI 3.141592653589
#define PB push_back
#define F first
#define S second
#define YESNO(T) if(T){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define yesno(T) if(T){cout<<"yes"<<endl;}else{cout<<"no"<<endl;}
#define YesNo(T) if(T){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
#define Yes(T) {cout<<"Yes"<<endl; if(T) return 0;}
#define No(T) {cout <<"No"<<endl; if(T) return 0;}
#define YES(T) {cout<<"YES"<<endl; if(T) return 0;}
#define NO(T) {cout <<"NO"<<endl; if(T) return 0;}
#define Graph vector<vector<int> >
#define CostGraph vector<vector<pair<int,ll> > >
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define VI vector<int>
#define VL vector<ll>
#define VVI vector<vector<int> >
#define VVL vector<vector<ll> >
#define VPII vector<pair<int,int> >
#define VPLL vector<pair<ll,ll> >
#define DDD fixed<<setprecision(10)
#define PAD setfill('0')<<right<<setw(8)
template <class T>
inline bool chmin(T &a, T b) {
if(a > b){ a = b; return true;}
return false;
}
template <class T>
inline bool chmax(T &a, T b) {
if(a < b){a = b; return true;}
return false;
}
struct input{
int n;
input() {}
input(int n_) : n(n_){};
template <class T>
operator T(){
T ret;
std::cin >> ret;
return ret;
}
template <class T>
operator std::vector<T>() {
std::vector<T> ret(n);
REP(i,n) std::cin >> ret[i];
return ret;
}
};
template <class T>
inline void printVec(std::vector<T> v){
REP(i,v.size()){
if(i) std::cout << " ";
std::cout << v[i];
} std::cout << std::endl;
}
using namespace std;
#line 1 "data-structure/cumulative-sum.hpp"
template<class T>
struct CumulativeSum{
vector<T> data;
vector<T> sum;
bool flgBuild;
CumulativeSum(){
flgBuild = false;
}
CumulativeSum(int n): data(n, 0), sum(n+1, 0){
flgBuild = false;
}
CumulativeSum(vector<T> &v): data(v), sum(v.size()+1, 0){
flgBuild = false;
build();
}
void update(int it, T value){
flgBuild = false;
data[it] = value;
}
void add(int it, T value){
flgBuild = false;
data[it] += value;
}
void build(){
if(flgBuild) return;
for(int i = 0; i < data.size(); ++i){
sum[i+1] = sum[i] + data[i];
}
flgBuild = true;
}
T get(int l, int r){
if(!flgBuild) build();
return sum[r] - sum[l];
}
};
#line 5 "verify/LC-StaticRangeSum.test.cpp"
int main(){
int N, Q;
cin >> N >> Q;
VL a = input(N);
CumulativeSum<ll> cs(a);
REP(i,Q){
int l, r;
cin >> l >> r;
cout << cs.get(l, r) << endl;
}
}