/*
 * FileName:     C_fix_2
 * CreatedDate:  2020-05-04 02:57:40 +0900
 * LastModified: 2020-05-04 03:33:02 +0900
 */

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct node_str{ int node;
    struct node_str *next;
}str;
void insert(str *list,int b){
    while(list->next!=NULL){
        list=list->next;
    }
    str *new = malloc(sizeof(str));
    new->node = b;
    list->next=new;
}
int main(void){
    int n,m;
    scanf("%d",&n);
    scanf("%d",&m);
    int *h = malloc(n*sizeof(int));
    str *list = malloc(n*sizeof(str));

    for(int i=0;i<n;i++){
        scanf("%d",&h[i]);
    }
    for(int i=0;i<m;i++){
        int a,b;
        scanf("%d",&a);
        scanf("%d",&b);
        insert(list+a-1,b-1);
        insert(list+b-1,a-1);
    }
    int *color = malloc(n*sizeof(int));
    for(int i=0;i<n;i++){
        color[i]=0;
    }
    int count=0;
    for(int i=0;i<n;i++){
        int flag=0;
        str *p = list+i;
        while(p->next!=NULL){
            p=p->next;
            if(h[i]<=h[p->node]||color[p->node]==1){
                flag=1;
                break;
            }
        }
        if(flag==0){
            color[i]=1;
            count++;
        }
        flag=0;
    }
    printf("%d\n",count);
    free(h);
    free(list);
    return 0;
}
