#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector <int> G[50005];
vector <int> v;
vector <int> :: iterator it;
int n,m,i,x,y;
bool sel[50005];
void dfs(int x)
{
    sel[x]=true;
    for(auto it : G[x])
        if(!sel[it])
        dfs(it);
    v.push_back(x);
}
int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        G[x].push_back(y);
    }
    for(i=1;i<=n;i++)
    {
        if(!sel[i])
            dfs(i);
    }
    reverse(v.begin(),v.end());
    for(auto it : v)
        g<<it<<' ';
    return 0;
}