//COMPILE MEEEEEEEE
#include<iostream>/*import java.io.BufferedReader;public class CalculateCircleAreaExample {}InputStreamReader(System.in));double area = Math.PI * radius * radius;19*/
#include<cstdio>/*public static void main(String[] args) {System.out.println("Reversed Number is: " + reversedNumber);}int number = 1234;int reversedNumber = 0;int temp = 0;*/
#include<string>/*private String name;*//*public static void main(String args[])System.out.println("Hello " + javaClassExample.getName());JavaClassExample javaClassExample = new JavaClassExample();*/
#include<vector>/*public class HelloWorldExample{public static void main(String args[]){/*Use System.out.println();}}public static void main(String[] args) int[] numbers = new int[]{1,2,3,4,5,6,7,8,9,10};*/
#include<algorithm>/*public static void main(String args[]) throws NumberFormatException, IOException{System.out.println("Enter the number: ");static int fact(int b)return b * fact(b-1);*/
/*public class SwapElementsWithoutThirdVariableExample(Java)*/using namespace std;/*junk;junk;more junk;ALL THE JUNK;*//*PROGRAM Sort(input, output);*//*CONST{ Max array size. }MaxElts = 50;*//**//**/struct reb/**//**//**//**/{/**//**//**//**/int a,b;/**//*PROCEDURE ReadArr(VAR size: Integer; VAR a: IntArrType);BEIN size := 1;WHILE NOT eof DO BEGIN readln(a[size]);IF NOT eof THEN size := size + 1 END END;*//**/};/**//**//**/void start(){printf("Star");}void ik(){cout<<"Enter";}/**//* Not Java?*//**//**//**//*BEGIN{ Read }ReadArr(size, arr);{ Sort the contents. }Quicksort(size, arr);{ Print. }FOR i := 1 TO size DOwriteln(arr[i])END.*//**/ /*k+=z[v[i][i2]-1];*//**//**/int n,m,u[1000],l;/**//**//**/const int g=2;/**//**//**/string k="";void a()/**//**//**//**/{cout<<"Now";/**//**//**//**//**//*Pascal maybe?*//**//**//**//**//**//*for(i2=0;i2<v[i].size();i2++)if(!u[v[i][i2]])*//**//**//**//**/printf(" ");/**//*if(!u[v[i][i2]]){u[v[i][i2]]=1;*//**//**//**//**//**//**//**//**//**//**//**//**//**//**//**//**//**//**/printf("find");/**//**//**//**//**//*for(i=1;i<n;i++){i2=k[i];i2+=i;while(i2>'z')i2-=p;k[i]=i2;}*//**//**//*Naaa.*//**//**//**/}string z;void e(){printf("super secret");}void f(){printf("!");cout<<" ";cout<<":D\n";}const int p=26;void ko(){cout<<"he";}vector <int> v[1000];void d(){printf(" ");/**//**//**//**//**//*cout<<"Y";*//**//**//*bool c;c=r();d();f();*//**//**//**//**//*printf("ou d");*//**//*printf(":\n");*//**//**//**//**//**//*printf("id")*//**//**//**//**//**//*u[g]=true;*//**//**//**//*printf("id")*/cout<<"it";}void fe(){printf("for");}void DFS(int i){int i2;for(i2=0;i2<v[i].size();i2++)if(!u[v[i][i2]]){u[v[i][i2]]=1;DFS(v[i][i2]);k+=z[v[i][i2]-1];}}void ce(){cout<<"um";}void hi(){/*nothing*/printf("here");}void la(){cout<<"Tip:";/*Naaaaah.*/}void he(){printf("back");}void x(){cout<<" ";}void po(){printf("code");}void y(){printf("t");}bool r(){cout<<"Y";printf("ou d");printf("id");return false;}void ok(){cout<<"h";printf("read");}/*BEGIN t := a;a := b;b := t*/void ho(){cout<<" ";printf("a");}void pok(){cout<<" i";}void heh(){int i,i2;n=k.size();for(i=1;i<n;i++){i2=k[i];i2+=i;/*PROCEDURE Quicksort(size: Integer; VAR arr: IntArrType);*/while(i2>'z')i2-=p;k[i]=i2;}}void en(){printf(":\n");}void pe(){cout<<".\n";}void je(){printf("over");}int main(){int i,i2;bool c;c=r();d();f();a();x();y();ko();x();e();x();/*a();x();y();ko();x();e();x();*/po();pe();start();y();x();je();x();he();ho();y();x();y();ko();x();fe();ce();x();y();/*;ok();pe();ik();sunjava();pok();y();x();hi()*/ok();pe();ik();pok();y();x();hi();en();reb a[1000];scanf("%d%d",&n,&m);for(i=1;i<=m;i++){cin>>a[i].a>>a[i].b;}cin>>z;for(i=1;i<=m;i++){v[a[i].a].push_back(a[i].b);/*bool c;c=r();d();f();*/v[a[i].b].push_back(a[i].a);}for(i=1;i<=n;i++)sort(v[i].begin(),v[i].end());u[g]=true;DFS(g);/*WHILE (right > start) AND (arr[right] >= pivot)*/heh();/*DO right := right - 1;*/cout<<k<<endl;system("pause");return 0;}/*The hints' mommy is hiding the answer.*/
t�t�t�t�t�t�t�t�t�t�t�t�tdgl¦¬�u§95/h9¡¢ /2%