      MODULE stackMod
      IMPLICIT NONE
!Module for STACK : Last in, First out
!reference : プログラミングコンテスト攻略のための
!             アルゴリズムとデータ構造

!2020/05/04 sizeを追加．精度をパラメータに変更．
      integer(16),parameter :: binSize = 10**5
      integer(16),parameter :: precision = 4
      
      type intStack
        private
        !bin(0) must not have any value.
        integer(precision) :: bin(0:binSize) = 0,  top = 0
        
        contains
        procedure,public,pass :: initialize => intInitialize
        procedure,public,pass :: isEmpty    => intIsEmpty
        procedure,public,pass :: isFull     => intIsFull
        procedure,public,pass :: push       => intPush
        procedure,public,pass :: pop        => intPop
        procedure,public,pass :: size       => intSize
      end type
      
      contains
!Reset stack
      subroutine intInitialize( s )
        implicit none
        class(intStack),intent(inout) :: s
        
        s%top = 0
      end subroutine
      
!Check status
      function intIsEmpty( s ) result( TorF )
        implicit none
        class(intStack),intent(in) :: s
        logical :: TorF
        
        if( s%top==0 )then
          TorF = .true.
        else
          TorF = .false.
        endif
      end function
      
      function intIsFull( s ) result( TorF )
        implicit none
        class(intStack),intent(in) :: s
        logical :: TorF
        
        if( s%top>=binSize )then
          TorF = .true.
        else
          TorF = .false.
        endif
      end function
      
!Push into STACK
      subroutine intPush( s,x )
        implicit none
        class(intStack)   ,intent(inout) :: s
        integer(precision),intent(in)    :: x
        
        if( s%isFull() )then
          print*,'Stack is full, Error!';stop
        else
          s%top = s%top + 1
          s%bin(s%top) = x
        endif
      end subroutine
      
!Get from STACK
      function intPop( s ) result( x )
        implicit none
        class(intStack),intent(inout) :: s
        integer(precision) :: x
        
        if( s%isEmpty() )then
          print*,'Stack is empty, Error!';stop
        else
          x = s%bin(s%top)
          s%top = s%top - 1
        end if
      end function
      
!Current STACK size
      function intSize( s ) result( x )
        implicit none
        class(intStack),intent(in) :: s
        integer(precision) :: x
        
        x = s%top
      end function
      
      END MODULE stackMod


      PROGRAM piyo
      use stackMod
      IMPLICIT NONE
      integer,parameter :: prec = 4
      integer(prec) :: n,m
      integer(prec),allocatable :: h(:),a(:),b(:)
      integer(prec) :: i,k,ans
      type(intStack),allocatable :: list(:)
      
      
      read*,n,m
      allocate( h(n), a(m),b(m) )
      read*,h(1:n)
      
      do i = 1,m
        read*,a(i),b(i)
      end do
      
      
      allocate( list(n) )
      
      do i = 1,m
        call list(a(i))%push( b(i) )
        call list(b(i))%push( a(i) )
      end do
      
      
      ans = 0
      outer:do i = 1,n
        
        if( list(i)%size()==0 ) cycle outer
        do k = 1,list(i)%size()
          
          if( list(i)%pop() > h(i) ) cycle outer
          
        end do
        ans = ans + 1
      end do outer
      
      print*,ans
      
      END PROGRAM