#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
long long pai[1111][1111];
long long tagsum[1111];
int num[1111];
int n, q;
int main()
{
    //freopen("out.txt", "w", stdout);
    //freopen("in.txt", "r", stdin);
    scanf("%d%d", &n, &q);
    for(int i = 1; i <= n; ++i)
        scanf("%d", &num[i]);
    memset(pai, 0, sizeof(pai));
    memset(tagsum, 0, sizeof(tagsum));
    for(int i = n; i >= 1; --i) {
        for(int j = i; j <= n; ++j) {
            if(num[i] > num[j]) {
                tagsum[j]++;
            }
            pai[i][j] = tagsum[j];
        }
    }
    for(int i = 1; i <= n; ++i) {
        for(int j = i+1; j <= n; ++j) {
            pai[i][j] = pai[i][j] + pai[i][j-1];
        }
    }
    for(int i = 0; i < q; ++i) {
        int l, r;
        scanf("%d%d", &l, &r);
        cout << pai[l][r] << endl;
    }
    return 0;
}