#include <fstream>
#include <vector>
#include <stack>
#define NMAX 50000

using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,x,y;
vector <int> v[NMAX];
bool viz[NMAX];
stack <int> ans;

void DFS(int nod)
{
    viz[nod] = 1;
    for(int i = 0 ; i < v[nod].size(); ++i)
        if(!viz[v[nod][i]])
            DFS(v[nod][i]);
    ans.push(nod);
}

int main()
{
    f >> n >> m;
    for(int i = 1; i <= m; ++i)
    {
        f >> x >> y;
        v[x].push_back(y);
    }
    for(int i = 1; i <= n; ++i)
        if(!viz[i])
            DFS(i);
    while(!ans.empty())
    {
        g << ans.top() << ' ' ;
        ans.pop();
    }
    f.close();
    g.close();
    return 0;
}