#include <fstream>
#include <vector>
#include <bitset>
#include <queue>
#define Nmax 100009

using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");

int n,m,s,x,y,sol[Nmax],nr;
bitset <Nmax> viz;
vector <int> G[Nmax];

void Dfs(int node)
{
    viz[node]=1;
    for (auto x : G[node])
        if (!viz[x]) Dfs(x);
    ++nr;
    sol[nr]=node;
}

int main()
{
    f>>n>>m;
    for (int i=1; i<=m; ++i)
    {
        f>>x>>y;
        G[x].push_back(y);
    }
    for (int i=1; i<=n; ++i)
        if (!viz[i]) Dfs(i);
    for (int i=nr; i>=1; --i) g<<sol[i]<<' ';
    g<<'\n';
    //for (auto x : cc) g<<x<<' ';
    //g<<'\n';
    f.close();
    g.close();
    return 0;
}