#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
typedef vector<int> vi;
vector<vi> List;
vi visited;
int pre[1001];
vector<int> Path;

void dfs(int s){
    visited[s] = 1;
    for(int i = 0; i<List[s].size(); i++){
        if(visited[List[s][i]] == 0){
            pre[List[s][i]] = s;
            dfs(List[s][i]);
        }
    }
}

int main() {

    int V,E,a,b;

    cin>>V>>E;
    List.assign(V+1, vi());
    visited.assign(V+1, 0);
    for(int i = 1; i<=E; i++){
        cin>>a>>b;
        List[a].push_back(b);
    }

    for(int i = 0; i<V; i++){
        int start = i, temp;
        dfs(start);
        while
    }

    return 0;
}