#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector <int> v[50005],q;
vector <int> :: iterator it;
int n,m,i,x,y;
bool ok[50005];
void dfs(int nod)
{vector <int>::iterator it;
    ok[nod]=true;
    for (it=v[nod].begin();it!=v[nod].end();it++)
    if (ok[*it]!=true)
        dfs(*it);
        g<<nod<<" ";
//q.push_back(nod);
}
int main()
{f>>n>>m;
for (i=1;i<=m;i++)
{f>>x>>y;
v[x].push_back(y);
}
for (i=1;i<=n;i++)
if (!ok[i]) dfs(i);
//reverse(q.begin(),q.end());
//for (it=q.begin();it!=q.end();it++) g<<*it<<" ";

}