#include <bits/stdc++.h>

// #include <atcoder/all>

using namespace std;
// using namespace atcoder;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
// #define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
// const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'



template <typename T1, typename T2>
class LazySegmentTree {
public:
  using F = function<T1(T1&, T1&)>; // query_func
  using G = function<T2(T2&, T2&)>; // update_func
  using H = function<T1(T1&, T2&, int, int)>; // lazy to node (node, lazy, left, right)
  int n;
  vector<T1> node;
  vector<T2> lazy;
  T1 e1;
  T2 e2;
  F query_func;
  G update_func;
  H eval_func;

  LazySegmentTree(){}

  LazySegmentTree(vector<T1> a, F query_func, G update_func, H eval_func, T1 e1, T2 e2)
    :query_func(query_func), update_func(update_func), eval_func(eval_func), e1(e1), e2(e2)
  {
    int _n = a.size();
    n = 1; while (n < _n) n *= 2;
    node.resize(2 * n - 1, e1);
    lazy.resize(2 * n - 1, e2);
    for (int i = 0; i < _n; i++) node[i + n - 1] = a[i];
    for (int i = n - 2; i >= 0; i--) {
      node[i] = query_func(node[i * 2 + 1], node[i * 2 + 2]);
    }
  }

  // k�Ԗڂ̃m�[�h�ɂ‚��Ēx���]�����s��
  inline void eval(int k, int l, int r) {
    if (lazy[k] != e2) { // Change
      node[k] = eval_func(node[k], lazy[k], l, r);
      if (r - l > 1) {
        lazy[2 * k + 1] = update_func(lazy[2*k + 1], lazy[k]);
        lazy[2 * k + 2] = update_func(lazy[2*k + 2], lazy[k]);
      }
      lazy[k] = e2; // Change
    }
  }

  // [a, b)��x�ɂ���
  void update(int a, int b, T2 x, int k, int l, int r) {
    // k �Ԗڂ̃m�[�h�ɑ΂��Ēx���]�����s��
    eval(k, l, r);
    if (b <= l || r <= a) return;
    if (a <= l && r <= b) {
      lazy[k] = update_func(lazy[k], x);
      eval(k, l, r);
    }
    else {
      update(a, b, x, 2 * k + 1, l, (l + r) / 2);
      update(a, b, x, 2 * k + 2, (l + r) / 2, r);
      node[k] = query_func(node[2 * k + 1], node[2 * k + 2]);
    }
  }

  T1 query(int a, int b, int k, int l, int r) {
    eval(k, l, r);
    if (b <= l || r <= a) return e1;
    if (a <= l && r <= b) return node[k];
    T1 resl = query(a, b, 2 * k + 1, l, (l + r) / 2);
    T1 resr = query(a, b, 2 * k + 2, (l + r) / 2, r);
    return query_func(resl, resr);
  }
};


vi a;
const int N = 20000;
struct Mo
{
  vector< int > left, right, order;
  vector< bool > v;
  int width;
  int nl, nr, ptr;
  ll inv1;
  LazySegmentTree<int, int> left_num, right_num, yaba;
  

  Mo(int n) : width((int) sqrt(n)), nl(0), nr(0), ptr(0), v(n), inv1(0) {}

  void insert(int l, int r) /* [l, r) */
  {
    left.push_back(l);
    right.push_back(r);
  }

  /* ソート */
  void build()
  {
    order.resize(left.size());
    iota(begin(order), end(order), 0);
    sort(begin(order), end(order), [&](int a, int b)
    {
      if(left[a] / width != left[b] / width) return left[a] < left[b];
      return right[a] < right[b];
    });
  }

  /* クエリを 1 つぶんすすめて, クエリのidを返す */
  int process()
  {
    if(ptr == order.size()) return (-1);
    const auto id = order[ptr];
    while(nl > left[id]) distribute_left(--nl);
    while(nr < right[id]) distribute_right(nr++);
    while(nl < left[id]) distribute_left(nl++);
    while(nr > right[id]) distribute_right(--nr);
    return (order[ptr++]);
  }

  inline void distribute_right(int idx)
  {
    v[idx].flip();
    if(v[idx]) add_right(idx);
    else del_right(idx);
  }

  inline void distribute_left(int idx)
  {
    v[idx].flip();
    if(v[idx]) add_left(idx);
    else del_left(idx);
  }

  void add_right(int idx) {
      int x = a[idx];
      inv1 -= right_num.query(0, x, 0, 0, right_num.n);
      inv1 -= left_num.query(x + 1, N, 0, 0, left_num.n);
      right_num.update(x, x + 1, -1, 0, 0, right_num.n);
      yaba.update(x + 1, N, -1, 0, 0, yaba.n);
  }

  void del_right(int idx) {
      int x = a[idx];
      inv1 += right_num.query(0, x, 0, 0, right_num.n);
      inv1 += left_num.query(x + 1, N, 0, 0, left_num.n);
      right_num.update(x, x + 1, 1, 0, 0, right_num.n);
      yaba.update(x + 1, N, 1, 0, 0, yaba.n);
  }

  void add_left(int idx) {
      int x = a[idx];
      inv1 -= right_num.query(0, x, 0, 0, right_num.n);
      inv1 -= left_num.query(x + 1, N, 0, 0, left_num.n);
      left_num.update(x, x + 1, -1, 0, 0, left_num.n);
      yaba.update(0, x, -1, 0, 0, yaba.n);
  }

  void del_left(int idx) {
      int x = a[idx];
      inv1 += right_num.query(0, x, 0, 0, right_num.n);
      inv1 += left_num.query(x + 1, N, 0, 0, left_num.n);
      left_num.update(x, x + 1, 1, 0, 0, left_num.n);
      yaba.update(0, x, 1, 0, 0, yaba.n);
  }
};

int f(int a, int b) {return a + b;}
int g(int a, int b) {return a + b;}
int h(int a, int b, int l, int r) {return a + b * (r - l);}
int f2(int a, int b) {return min(a, b);}
int h2(int a, int b, int l, int r) {return a + b;}

signed main() {
    fio();
    
    int n, q;
    cin >> n >> q;
    a.resize(n);
    rep (i, n) {
        cin >> a[i];
        a[i]--;
    }

    LazySegmentTree<int, int> left_num(vi(N), f, g, h, 0, 0), right_num(vi(N), f, g, h, 0, 0);
    LazySegmentTree<int, int> yaba(vi(N), f2, g, h2, inf, 0);
    ll ten = 0;
    rrep (i, n) {
        int x = a[i];
        ten += right_num.query(0, x, 0, 0, right_num.n);
        right_num.update(x, x + 1, 1, 0, 0, right_num.n);
    }
    rep1 (i, N - 1) {
        int x = right_num.query(0, i, 0, 0, right_num.n);
        yaba.update(i, i + 1, x, 0, 0, right_num.n);
    }
    DEBUG(ten);
    Mo mo(n);

    mo.inv1 = ten;
    mo.left_num = left_num;
    mo.right_num = right_num;
    mo.yaba = yaba;

    vector<pii> lr;
    rep (i, q) {
        int l, r;
        cin >> l >> r;
        l--;
        mo.insert(l, r);
        lr.push_back(pii(l, r));
    }
    mo.build();

    vi ans(q);
    rep (i, q) {
        int idx = mo.process();
        ans[idx] = mo.inv1 + mo.yaba.query(0, N, 0, 0, yaba.n) * (lr[idx].second - lr[idx].first);
    }

    rep (i, q) {
        cout << ans[i] << endl;
    }
}