#include<bits/stdc++.h>

using namespace std;
const int N = 5010, M = 100010;

int h[N], e[M], ne[M], idx;
int d[N];
int n, m;
int q[N];
bool flag;
int pm[N];

void add(int a, int b)
{
    e[idx] = b, ne[idx] = h[a], h[a] = idx++;
    d[b]++;
}

void topsort()
{
    int hh = 0, tt = -1;
    for(int i = 1; i <= n; i++)
    {
        if(!d[i]) q[++tt] = i;
        if(tt > hh) flag = true;
    }

    while(hh <= tt)
    {
        int t = q[hh++];
        for(int i = h[t]; ~i; i = ne[i])
        {
            int j = e[i];
            --d[j];
            if(!d[j]) q[++tt] = j;
            if(tt > hh) flag = true;
        }
    }
}

int main()
{
    scanf("%d", &n);
    scanf("%d", &m);
    memset(h, -1, sizeof h);

    for(int i = 0; i < m; i++)
    {
        int a, b;
        scanf("%d %d", &a, &b);
        add(a, b);
    }

    topsort();

    for(int i = 0; i < n; i++)
    {
        pm[q[i]] = i + 1;
    }

    for(int i = 1; i <= n; i++)
    {
        cout << pm[i] << endl;
    }
    if(flag) cout << "1" << endl;
    else cout << "0" << endl;
    return 0;
}