#include <bits/stdc++.h>

using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
set < int > s;
vector < int > sol;
vector < int > v[100001];
int n,m;
int grade[100001];
int main()
{
f>>n>>m;
int i;
for(i=1;i<=m;i++)
{
    int n1,n2;
    f>>n1>>n2;
    v[n1].push_back(n2);
    grade[n2]++;
}
for(i=1;i<=n;i++)
if(grade[i]==0)
    s.insert(i);
//s.erase(s.begin());
//cout<<*s.begin();
while(!s.empty())
{
    int node=*s.begin();
    s.erase(s.begin());
    sol.push_back(node);
    for(auto nod_m : v[node])
    {
        grade[nod_m]--;
        if(grade[nod_m]==0)s.insert(nod_m);
    }
}
for(auto it : sol)
    g<<it<<' ';



    return 0;
}