#include <bits/stdc++.h>
using namespace std;
int i, j, k, l, n, m, a[120000], tot, x, y;
long long ans;
struct ppp {
  int k, l, r;
  void make(int k_, int l_, int r_) {
    k = k_;
    l = l_;
    r = r_;
  }
} q[210000];
struct set_tree {
  int s[410000], sign[410000];
  void modify(int p, int o) {
    sign[p] ^= 1;
    s[p] = o - s[p];
  }
  void updata(int p, int l, int r) {
    int mid = (l + r) / 2;
    if (sign[p]) {
      sign[p] = 0;
      modify(p * 2, mid - l + 1);
      modify(p * 2 + 1, r - mid);
    }
  }
  void change(int p, int l, int r, int x, int y) {
    int mid = (l + r) / 2;
    if (x <= l && y >= r) {
      modify(p, r - l + 1);
      return;
    }
    updata(p, l, r);
    if (x <= mid) change(p * 2, l, mid, x, y);
    if (y > mid) change(p * 2 + 1, mid + 1, r, x, y);
    s[p] = s[p * 2] + s[p * 2 + 1];
  }
  int calc(int p, int l, int r, int x, int y) {
    if (x > y) return 0;
    int mid = (l + r) / 2;
    if (x <= l && y >= r) return s[p];
    updata(p, l, r);
    int res = 0;
    if (x <= mid) res += calc(p * 2, l, mid, x, y);
    if (y > mid) res += calc(p * 2 + 1, mid + 1, r, x, y);
    return res;
  }
} t;
int find(int x) {
  int l = 1, r = n, mid;
  while (l <= r) {
    mid = (l + r) / 2;
    if (a[mid] < x)
      l = mid + 1;
    else
      r = mid - 1;
  }
  return l - 1;
}
bool cmp(const ppp& a, const ppp& b) { return a.k < b.k; }
int main() {
  scanf("%d%d", &n, &k);
  for (i = 1; i <= n; ++i) scanf("%d", &a[i]);
  sort(a + 1, a + n + 1);
  for (i = 1; i <= k; ++i) {
    scanf("%d%d", &x, &y);
    x = find(x) + 1;
    y = find(y + 1);
    if (x > y) continue;
    q[++tot].make(x, x, y);
    q[++tot].make(y + 1, x, y);
  }
  sort(q + 1, q + tot + 1, cmp);
  j = 1;
  for (i = 1; i <= n; ++i) {
    while (j <= tot && q[j].k == i) {
      t.change(1, 1, n, q[j].l, q[j].r);
      j++;
    }
    x = i - 1 - t.calc(1, 1, n, 1, i - 1) + t.calc(1, 1, n, i + 1, n);
    ans += (long long)x * (x - 1) / 2;
  }
  printf("%I64d\n", (long long)n * (n - 1) * (n - 2) / 6 - ans);
}
