/*
 _____ _             _              _           _
|_   _| |__   ___   / \   _ __  ___| |__  _   _| |
  | | | '_ \ / _ \ / _ \ | '_ \/ __| '_ \| | | | |
  | | | | | |  __// ___ \| | | \__ \ | | | |_| | |
  |_| |_| |_|\___/_/   \_\_| |_|___/_| |_|\__,_|_|

*/
#include<bits/stdc++.h>
#define ll          long long
#define pb          push_back
#define ppb         pop_back
#define    endl        '\n'
#define mii         map<ll int,ll int>
#define msi         map<string,ll int>
#define mis         map<ll int, string>
#define rep(i,a,b)    for(ll int i=a;i<b;i++)
#define mpi         map<pair<ll int,ll int>,ll int>
#define pii         pair<ll int,ll int>
#define vi          vector<ll int>
#define vii         vector<pair<ll int, ll int>>
#define vs          vector<string>
#define all(a)      (a).begin(),(a).end()
#define F           first
#define S           second
#define sz(x)       (ll int)x.size()
#define hell        1000000007
#define lbnd        lower_bound
#define ubnd        upper_bound
#define bs          binary_search
#define mp          make_pair
#define what_is(x)  cerr << #x << " is " << x << endl;
#define time        cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
using namespace std;
#define PI 3.141592653589793
#define N  100005
ll a[N];
void solve()
{
    ll n,q;
    cin>>n>>q;
    vi v;
    rep(i,0,n)
    {
        ll x;
        cin>>x;
        v.pb(x);
        a[i+1]=(x%2==0);
    }
    // rep(i,1,n+1)
    //     a[i]+=a[i-1];
    vii tmp;
    rep(i,0,q)
    {
        ll l,r;
        cin>>l>>r;
        tmp.pb({l,r});
        ll eve=0;
        ll odd=0;
        rep(j,l,r+1)
        {
            if(a[j])
                eve++;
            else
                odd++;
        }
        cout<<(eve*(eve-1))/2+eve*odd<<endl;
    }

    // assert(n>=1 && n<=100000);
    // assert(q>=1 && q<=100000);
    // assert(sz(v)==n);
    // rep(i,0,n)
    //     assert(v[i]>=1 && v[i]<=1000000000);
    // assert(sz(tmp)==q);
    // rep(i,0,q)
    // {
    //     assert(tmp[i].F>=1 && tmp[i].F<=n);
    //     assert(tmp[i].S>=1 && tmp[i].S<=n);
    //     assert(tmp[i].F<=tmp[i].S);
    // }

    return;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int TESTS=1;
//    cin>>TESTS;
    while(TESTS--)
    {
        solve();
    }
    time
    return 0;
}