#include <fstream>
#include <vector>
#include <bitset>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");

vector < int > G[50005];
int n, m, sol[50005], dim, x, y;
bitset < 50005 > viz(0);

void dfs(int nod)
{
    viz[nod]=1;
    for (int i=0; i<G[nod].size(); ++i)
        if (!viz[G[nod][i]]) dfs(G[nod][i]);
    sol[++dim]=nod;
}

int main()
{
    f>>n>>m;
    for (int i=1; i<=m; ++i)
    {
        f>>x>>y;
        G[x].push_back(y);
    }

    for (int ii=1; ii<=n; ++ii)
        if (!viz[ii]) dfs(ii);

    for (int i=dim; i>0; --i)
        g<<sol[i]<<' ';
    return 0;
}