#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;

const ll MOD = (ll)1e9 + 7;
const ll MOD2 = 998244353;
const ll HIGHINF = (ll)1e18;
const ll LOWINF = (ll)1e15;
const long double PI = 3.1415926535897932384626433;

template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max<T>(a,b);}
template <class T> void chmin(T& a, const T b){a=min<T>(a,b);}
void YN(bool flg) {cout << ((flg) ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << ((flg) ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << ((flg) ? "yes" : "no") << endl;}

int main() {
    int N,M; cin >> N >> M;
    V<V<int>> c(N,V<int>(N,2));
    for(int i = 0; i < M; ++i) {
        int u,v; cin >> u >> v;
        u--,v--;
        c[u][v]=1;
        c[v][u]=0;
    }
    V<int> node(N,0),ord(N,N+3);
    for(int i = 0; i < N; ++i) for(int j = 0; j < N; ++j) if(c[i][j]==0) node[i]++;
    queue<int> q;
    for(int i = 0; i < N; ++i) if(!node[i]) {
        q.push(i);
        ord[i] = 0;
    }
    while(q.size()){
        int from = q.front();
        q.pop();

        for(int to = 0; to < N; ++to){
            if(c[from][to]!=1 || node[to]==0) continue;
            node[to]--;
            if(node[to]==0){
                q.push(to);
                ord[to] = ord[from] + 1;                
            }
        }
    }

    V<P<int,int>> d(N);
    for(int i = 0; i < N; ++i) d[i] = {ord[i],i+1};
    sort(ALL(d));
    int flg = 0;
    for(int i = 0; i < N; ++i) if(ord[i] == N + 3) flg = 1;
    for(int i = 0; i < N-1; ++i) if(d[i].first==d[i+1].first) flg = 1;
    for(int i = 0; i < N; ++i) cout << d[i].second << endl;
    cout << flg << endl; 
    return 0;
}



Measured memory_bytes: 100776