import java.util.*;
import java.io.*;
import static java.lang.Math.*;
public class Main {
    static final long MOD = 1_000_000_007, INF = 1_000_000_000_000_000_000L;
    static final int INf = 1_000_000_000;
    static FastReader reader;
    static PrintWriter writer;
    public static void main(String[] args) {
        Thread t = new Thread(null, new O(), "Integer.MAX_VALUE", 100000000);
        t.start();
    }
    static class O implements Runnable {
        public void run() {
            try {
                magic();
            }
            catch (Exception e) {
                e.printStackTrace();
                System.exit(1);
            }
        }
    }
    static class FastReader {
        final private int BUFFER_SIZE = 1 << 16;
        private DataInputStream din;
        private byte[] buffer;
        private int bufferPointer, bytesRead;

        public FastReader() {
            din = new DataInputStream(System.in);
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public FastReader(String file_name) throws IOException {
            din = new DataInputStream(new FileInputStream(file_name));
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public String readLine() throws IOException {
            byte[] buf = new byte[1000000];
            int cnt = 0, c;
            while ((c = read()) != -1) {
                if (c == '\n') break;
                buf[cnt++] = (byte) c;
            }
            return new String(buf, 0, cnt);
        }

        public int nextInt() throws IOException {
            int ret = 0;
            byte c = read();
            while (c <= ' ') c = read();
            boolean neg = (c == '-');
            if (neg) c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');
            if (neg) return -ret;
            return ret;
        }

        public long nextLong() throws IOException {
            long ret = 0;
            byte c = read();
            while (c <= ' ') c = read();
            boolean neg = (c == '-');
            if (neg) c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');
            if (neg) return -ret;
            return ret;
        }

        public double nextDouble() throws IOException {
            double ret = 0, div = 1;
            byte c = read();
            while (c <= ' ') c = read();
            boolean neg = (c == '-');
            if (neg) c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');
            if (c == '.') while ((c = read()) >= '0' && c <= '9') ret += (c - '0') / (div *= 10);
            if (neg) return -ret;
            return ret;
        }

        private void fillBuffer() throws IOException {
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
            if (bytesRead == -1) buffer[0] = -1;
        }

        private byte read() throws IOException {
            if (bufferPointer == bytesRead) fillBuffer();
            return buffer[bufferPointer++];
        }

        public void close() throws IOException {
            if (din == null) return;
            din.close();
        }
    }
    static void magic() throws IOException {
        reader = new FastReader();
        writer = new PrintWriter(System.out, true);
        int n = reader.nextInt(), m = reader.nextInt();
        HashSet<Integer> to_the_right[] = new HashSet[n+1];
        HashSet<Integer> to_the_left[] = new HashSet[n+1];
        int pos[] = new int[n+1];
        int p[] = new int[n+1];
        for(int i=1;i<=n;++i) {
            to_the_left[i] = new HashSet<>();
            to_the_right[i] = new HashSet<>();
            p[i] = reader.nextInt();
            pos[p[i]] = i;
        }
        for(int i=1;i<=m;++i) {
            int u = reader.nextInt(), v = reader.nextInt();
            //writer.println("pos of u: "+pos[u]+" pos of v: "+pos[v]);
            if(pos[u]<pos[v]) {
                //writer.println("added "+v+" to "+u);
                to_the_right[u].add(v);
                to_the_left[v].add(u);
            }
        }
        int ans = 0;
        int curr = 1;
        for(int i=n-1;i>0;--i) {
            //writer.println("ele: "+p[i]+" size: "+to_the_right[p[i]].size()+" curr: "+curr);
            if(to_the_right[p[i]].size()==curr) {
                //writer.println("will go to the right: "+p[i]);
                ans++;
                for(int e : to_the_left[p[i]]) {
                    to_the_right[e].remove(p[i]);
                }
            }
            else {
                curr++;
            }
        }
        writer.println(ans);
    }
}