#include <iostream>
#include <fstream>
#include <vector>
#include <deque>
#include <stack>
#include <bitset>
#define MAX 250001
using namespace std;

vector <unsigned int>   vecini [ MAX ] , stiva;
deque < unsigned int > q_a [ MAX ];

bitset <1>  viz[ 250002 ];

int main()
{
    int n,m,p,q,i = 1;
    ifstream f("stramosi.in",ios::in);
    ofstream g("stramosi.out",ios::out);
    f>>n>>m;
    // lista de adiacenta
    for(i = 1;i <= n ; i++){
        f>>p;
        vecini[ p ].push_back( i );
    }

    // citesc cererile
    while( m ){
        f>>q>>p;
        q_a[ q ].push_back( p );  // pt fiecare membru p am o lista cu cereri de stramosi
        m--;
    }
    /*
    for(i = 0;i <= n ; i++){
        cout<<i<<" : ";
        for(int j = 0; j <cereri[i].size(); j++)
            cout<<cereri[i][j]<<" ";
        cout<<endl;
    }
    */

    return 0;
}