#include <iostream>
#include <vector>
#include <cstdio>
#include <queue>
#include <bitset>
#define N 100005

using namespace std;

vector <int> G[N];

bitset <N> viz;

queue <int > Q;

int n,m,s,p[N];

void dfs(int vf)
{ viz[vf]=1;
vector <int>::iterator it;
    for(it=G[vf].begin(); it!=G[vf].end();++it)
    if(!viz[*it])
        dfs(*it);
}

void citire()
{
    scanf("%d %d %d\n",&n,&m);
    for(int i=0; i<m; i++)
    {
        int x,y;
        scanf("%d %d\n",&x,&y);
        G[x].push_back(y);
    }
}

int main()
{
    freopen("dfs.in","r",stdin);
    freopen("dfs.out","w",stdout);

    citire();

    return 0;
}