#include<stdio.h>
#include<math.h>
#include<string.h>
#define T 100000
int main(){
    int N,M;
    scanf("%d %d",&N,&M);

    int H[N];
    int i;
    for(i=0;i<N;i++){
        scanf("%d",&H[i]);
    }

    int j;
    int A[M];
    int B[M];
    int flag[N];
    int L;
    for(i=0;i<N;i++){
        flag[i] = 1;
    }

    for(j=0;j<M;j++){
        scanf("%d %d",&A[j],&B[j]);

        if(H[ (A[j]-1) ] > H[ (B[j]-1) ]) {flag[A[j] -1] =1; flag[B[j] -1] = 0;}
        else if(H[ (A[j]-1) ] == H[ (B[j]-1) ]) {flag[A[j] -1] =0; flag[B[j] -1] = 0;}
        else{flag[B[j]-1] =1; flag[A[j]-1] = 0;}
     


    
    }



    int count=0;
    for(i=0;i<N;i++){
        if(flag[i] == 1){count += 1;}
    }

    printf("%d",count);


return 0;

}