#include<stdio.h>
#include<algorithm>
#define MAXV 100000
#define MAXE 200000
void dfs(int nod);
int lista[MAXV+1],next[MAXE+1],val[MAXE+1],k=0;
int level[MAXV+1];
bool viz[MAXV+1];
int index=0;
FILE*fin,*fout;
int main()
{
    fin=fopen("ctc.in","r");
    fout=fopen("ctc.out","w");
    int V,E;
    fscanf(fin,"%d %d",&V,&E);
    for(int i=1;i<=V;i++)
    {
        int x,y;
        fscanf(fin,"%d%d",&x,&y);
        next[++p]=lista[x];
        val[p]=y;
        lista[x]=p;
    }
    for(int i=0;i<=)
    fclose(fin);
    fclose(fout);
    return 0;
}
void dfs(int nod)
{
    index++;
    level[nod]=index;
    int p=lista[nod];
    while(p!=0)
    {
        int vec=val[p];
        if(!viz[vec])
        {
            viz[vec]=1;
            dfs(vec);
            level[nod]=std::min(level[nod],level[vec]);
        }
        p=next[p];
    }
    p = lista[nod];
    while(p != 0){
        if(nivel[nod] < nivel[val[p]])
            critic[p] = 1;

    }
}