#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
inline T1 max(T1 a, T2 b) {
  return a < b ? b : a;
}
template <typename T1, typename T2>
inline T1 min(T1 a, T2 b) {
  return a < b ? a : b;
}
const char lf = '\n';
namespace ae86 {
const int bufl = 1 << 15;
char buf[bufl], *s = buf, *t = buf;
inline int fetch() {
  if (s == t) {
    t = (s = buf) + fread(buf, 1, bufl, stdin);
    if (s == t) return EOF;
  }
  return *s++;
}
inline int ty() {
  int a = 0;
  int b = 1, c = fetch();
  while (!isdigit(c)) b ^= c == '-', c = fetch();
  while (isdigit(c)) a = a * 10 + c - 48, c = fetch();
  return b ? a : -a;
}
}  // namespace ae86
using ae86::ty;
const int _ = 100007;
struct sgt {
  static const int _t = _ << 2;
  long long val[_t], sum[_t];
  int trev[_t];
  inline void up(int x) { val[x] = val[(x << 1)] + val[(x << 1 | 1)]; }
  inline void putrev(int x) { trev[x] ^= 1, val[x] = sum[x] - val[x]; }
  inline void dwn(int x) {
    if (trev[x]) putrev((x << 1)), putrev((x << 1 | 1)), trev[x] = 0;
  }
  void plant(int x, int l, int r) {
    sum[x] = r - l + 1, val[x] = 0, trev[x] = 0;
    if (l == r) return;
    plant((x << 1), l, ((l + r) >> 1)),
        plant((x << 1 | 1), ((l + r) >> 1) + 1, r), up(x);
  }
  void change(int x, int l, int r, int tl, int tr) {
    if (tl <= l && r <= tr) {
      putrev(x);
      return;
    }
    dwn(x);
    if (tl <= ((l + r) >> 1)) change((x << 1), l, ((l + r) >> 1), tl, tr);
    if (tr > ((l + r) >> 1))
      change((x << 1 | 1), ((l + r) >> 1) + 1, r, tl, tr);
    up(x);
  }
  long long finder(int x, int l, int r, int tl, int tr) {
    if (tl <= l && r <= tr) return val[x];
    dwn(x);
    if (tr <= ((l + r) >> 1))
      return finder((x << 1), l, ((l + r) >> 1), tl, tr);
    if (tl > ((l + r) >> 1))
      return finder((x << 1 | 1), ((l + r) >> 1) + 1, r, tl, tr);
    return finder((x << 1), l, ((l + r) >> 1), tl, tr) +
           finder((x << 1 | 1), ((l + r) >> 1) + 1, r, tl, tr);
  }
} t;
int n, qn, val[_];
vector<int> fr[_], fl[_];
int main() {
  ios::sync_with_stdio(0), cout.tie(nullptr);
  n = ty(), qn = ty();
  for (int i = 1; i <= n; i++) val[i] = ty();
  sort(val + 1, val + n + 1);
  for (int i = 1; i <= qn; i++) {
    int a = ty(), b = ty(), l = lower_bound(val + 1, val + n + 1, a) - val,
        r = upper_bound(val + 1, val + n + 1, b) - val - 1;
    if (l <= r) fr[l].emplace_back(r), fl[r].emplace_back(l);
  }
  t.plant(1, 1, n);
  long long ans = 1ll * n * (n - 1) * (n - 2) / 6;
  for (int i = 1; i <= n; i++) {
    for (auto a : fr[i]) t.change(1, 1, n, i, a);
    long long dlt = 0;
    if (i > 1) dlt += i - 1 - t.finder(1, 1, n, 1, i - 1);
    if (i < n) dlt += t.finder(1, 1, n, i + 1, n);
    ans -= dlt * (dlt - 1) / 2;
    for (auto a : fl[i]) t.change(1, 1, n, a, i);
  }
  cout << ans << lf;
  return 0;
}
