#include <fstream>

using namespace std;

ifstream f("inversari.in");
ofstream g("inversari.out");

int n,m,i,j,id[5001][5001]/*,d[5001][5001]*/,a[5001],mi;

int main () {
    f >> n >> m;
    for (i=1;i<=n;i++)
        f >> a[i];
    for (j=1;j<=n;j++)
       for (i=1;i<=j;i++)
           if(a[j-i+1]<=a[j]) id[i][j] = id[i-1][j];
                      else  id[i][j] = id[i-1][j]+1;
    for (i=1;i<=n;i++)
       for (j=1;j<=n;j++)
           id[i][j]=id[i-1][j-1]+id[i][j];
    for (mi=1;mi<=m;mi++) {
        f >> i >> j;
        g << id[j-i+1][j] << '\n';
    }
    f.close();g.close();
    return 0;
}