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

int N, M, x, y;
bool viz[50005];
vector < int > G[50005], sol;

void dfs(int nod)
{
    viz[nod]=1; sol.push_back(nod);
    vector <int>::iterator it=G[nod].begin();
    for (; it!=G[nod].end(); ++it)
        if (!viz[*it]) dfs(*it);
}

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=0; i<sol.size(); ++i)
        g<<sol[i]<<' ';
    return 0;
}