Link to this code: `https://cses.fi/paste/c7245c3afad5f4c7f303e/`
```/*
Author : Chandan Agrawal
College : Poornima College of Engg. jaipur, Raj
Mail : chandanagrawal23@gmail.com

" when you are not practicing someone else is ,
and the day u meet them u will lose "

*/
#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;

#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define MAX 600050

#define ll long long
#define ld long double
#define lli long long int

#define pb push_back
#define INF 1000000000000
#define mod 1000000007

// trignometric function always give value in Radians only
#define PI acos(-1) //3.1415926535897932384626433832795028
#define dsin(degree) sin(degree*(PI/180.0))
#define dcos(degree) cos(degree*(PI/180.0))
#define dtan(degree) tan(degree*(PI/180.0))

#define mem0(a) memset(a,0,sizeof(a))
#define mem1(a) memset(a,-1,sizeof(a))
#define memf(a) memset(a,false,sizeof(a))

#define loop(i,n)  for (lli i = 0; i < n; i++)
#define FOR(i,a,b) for (lli i = a; i < b; i++)

#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define makeuniq(v) v.resize(unique(all(v)) - v.begin()); //only uniq element in vector after this
#define sz(x) int(x.size())
#define F first
#define S second

#define mii map<lli,lli>

#define pii pair<lli,lli>

#define vi vector<lli>
#define vvi vector<vi>
#define vpi vector<pii>
#define vbool vector<bool>

#define seti set<lli>

#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) (a/gcd(a,b))*b
#define abs(x) ((x < 0)?-(x):x)

#define endl '\n'

{
}
{
print(tail...);
}

#define scanarr(a,n) for(lli i=0;i<n;i++)    cin>>a[i];
#define scanvec(a,n) for(lli i=0;i<n;i++){ lli x ; cin>>x; a.pb(x);}

#define printarr(a,n) for(lli i=0;i<n;i++)   cout<<a[i]<<" "; cout<<endl;
#define printvec(vec) for(auto xt : vec) cout<<xt<<" ";    cout<<"\n";

#define FD(N) fixed<<setprecision(N)

#define deb(x) cout<<#x<<" "<<x<<endl;

/*
1D vector -  vi dp(n,value);
2D vector -  vvi dp(n,vi(n,value));
*/

// chandan1,2
void chandan1(){int y=1;return;}
void chandan2(){
loop(i,10){
lli x=1;
}
return(chandan1());
}

//---------------------------------------------------BIT----------------------------------------------------------------------

lli BIT[MAX], a[MAX], n;
void update(lli x , lli val)
{
while(x<=n)
{
BIT[x] += val;
x += (x&-x);
}
}

lli query(lli x)
{
lli sum = 0;
while(x>0)
{
sum += BIT[x];
x -= (x&-x);
}

return sum;
}

//--------------------------------------------------BIT------------------------------------------------------------------------

void coordinate_compress(lli a[] , lli n)
{
lli temp[n];

loop(i,n)
temp[i] = a[i];

sort(temp, temp + n);

loop(i,n)
a[i] = lower_bound(temp, temp + n, a[i]) - temp + 1;
}

int main(){
fastio
lli t=1;
//cin>>t;
chandan2();
while(t--) {
lli q;
cin>>n>>q;
FOR(i,1,n+1){
cin>>a[i];
update(i,a[i]);
}
while(q--)
{
lli l,r;
cin>>l>>r;
print(query(r)-query(l-1));

}

}
return 0;
}```