#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define PII pair<int,int >;
#define int long long
#define IOS std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
using namespace std;
const int N = 1e6+5;
int n,m;
int x,y;
int sum;
int in[N];
vector<int>e[N];
void topsort()
{
queue<int>q;
for(int i=1;i<=n;i++)
{
if(in[i]==0)
{
if(q.size())
{
sum=1;
}
q.push(i);
}
}
while(q.size())
{
int now=q.front();
q.pop();
cout<<now<<"\n";
for(auto spot:e[now])
{
if(--in[spot]==0)
{
if(q.size())
{
sum=1;
}
q.push(spot);
}
}
}
cout<<sum;
}
signed main()
{
IOS;
cin>>n;
cin>>m;
while(m--)
{
cin>>x>>y;
e[x].pb(y);
in[y]++;
}
topsort();
}