#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("-ffloat-store")
using namespace std;
clock_t time_p = clock();
void aryanc403() {}
const long long int INF = 0xFFFFFFFFFFFFFFFL;
long long int seed;
mt19937 rng(seed = chrono::steady_clock::now().time_since_epoch().count());
inline long long int rnd(long long int l = 0, long long int r = INF) {
  return uniform_int_distribution<long long int>(l, r)(rng);
}
class CMP {
 public:
  bool operator()(pair<long long int, long long int> a,
                  pair<long long int, long long int> b) {
    return !(a.first < b.first || (a.first == b.first && a.second <= b.second));
  }
};
void add(map<long long int, long long int> &m, long long int x,
         long long int cnt = 1) {
  auto jt = m.find(x);
  if (jt == m.end())
    m.insert({x, cnt});
  else
    jt->second += cnt;
}
void del(map<long long int, long long int> &m, long long int x,
         long long int cnt = 1) {
  auto jt = m.find(x);
  if (jt->second <= cnt)
    m.erase(jt);
  else
    jt->second -= cnt;
}
bool cmp(const pair<long long int, long long int> &a,
         const pair<long long int, long long int> &b) {
  return a.first < b.first || (a.first == b.first && a.second < b.second);
}
const long long int mod = 1000000007L;
const long long int maxN = 100000L;
long long int T, n, i, j, k, in, cnt, l, r, u, v, x, y;
long long int m, ans;
string s;
vector<long long int> a;
vector<pair<long long int, long long int> > q[maxN + 5];
long long int f[4 * maxN + 5], L[4 * maxN + 5];
void flp(long long int id, long long int l, long long int r) {
  if (id > 4 * maxN) return;
  f[id] = (r - l + 1) - f[id];
  L[id] ^= 1;
}
void push(long long int id, long long int l, long long int r) {
  if (!L[id]) return;
  long long int m = (l + r) / 2;
  flp(2 * id, l, m);
  flp(2 * id + 1, m + 1, r);
  L[id] = 0;
}
void update(long long int id, long long int l, long long int r, long long int L,
            long long int R) {
  if (r < L || R < l) return;
  push(id, l, r);
  if (L <= l && r <= R) {
    flp(id, l, r);
    return;
  }
  long long int m = (l + r) / 2;
  update(2 * id, l, m, L, R);
  update(2 * id + 1, m + 1, r, L, R);
  f[id] = f[2 * id] + f[2 * id + 1];
}
long long int query(long long int id, long long int l, long long int r,
                    long long int L, long long int R) {
  if (L > R || r < L || R < l) return 0;
  push(id, l, r);
  if (L <= l && r <= R) return f[id];
  long long int m = (l + r) / 2;
  return query(2 * id, l, m, L, R) + query(2 * id + 1, m + 1, r, L, R);
}
int main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  {
    cin >> n >> k;
    a.clear();
    a.reserve(n);
    for (i = 0; i < (n); ++i) {
      cin >> in;
      a.push_back(in);
    }
    a.push_back(-INF);
    a.push_back(INF);
    sort(a.begin(), a.end());
    ans -= n * (n - 1) * (n - 2) / 6;
    ;
    while (k--) {
      cin >> l >> r;
      l = lower_bound(begin(a), end(a), l) - a.begin();
      r = upper_bound(begin(a), end(a), r) - a.begin();
      r--;
      q[l].push_back({l, r});
      q[r + 1].push_back({l, r});
    }
    for (i = (1); i <= (n); ++i) {
      long long int cnt = 0;
      for (auto x : q[i]) update(1, 1, n, x.first, x.second);
      cnt += query(1, 1, n, 1, i - 1);
      cnt += (n - i) - query(1, 1, n, i + 1, n);
      ;
      cnt = n - 1 - cnt;
      ans += cnt * (n - cnt - 1);
    }
    ans /= 2;
    ;
    cout << ans << "\n";
  }
  aryanc403();
  return 0;
}
