#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 1e5 + 10;
struct Event{
	int x, type;
	bool operator < (const Event& rhs) const{
    if(x == rhs.x) return type < rhs.type;
    return x < rhs.x;
  }
}a[maxn * 3];
int n, m;
int main()
{
	freopen("bg.in", "r", stdin);
	freopen("bg.out", "w", stdout);
	scanf("%d%d", &n, &m);
	int l, r, e = n;
	for(int i = 0; i < n; i++){
	  scanf("%d", &l);
	  a[i] = (Event){l, 0};
  }
  for(int i = 0; i < m; i++){
    scanf("%d%d", &l, &r);
    a[e++] = (Event){l, -1};
    a[e++] = (Event){r, 1};
  }
  sort(a, a + e);
  int cnt = 0, ans = 0; l = 0;
  for(int i = 0; i < e; i++){
    if(a[i].type < 0) cnt = ++l;
    else if(a[i].type > 0) cnt = --l;
    else if(cnt > 0) {ans++; cnt--;} 
  }
  printf("%d\n", ans);
	return 0;
}