#include <fstream>
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int N, M, x, y, nr, postordine[50010], fr[50010];
vector < int > V[50010];

void DFS(int nod)
{
    fr[nod] = 1;
    for (int j=0; j<V[nod].size(); j++)
    {
        if (!fr[V[nod][j]])
        {
            DFS(V[nod][j]);
        }
    }
    postordine[++nr] = nod;
}

int main()
{
    fin >> N >> M;
    for (int i=1; i<=M; i++)
    {
        fin >> x >> y;
        V[x].push_back(y);
    }

    for (int i=1; i<=N; i++)
    {
        if (!fr[i])
        {
            DFS(i);
        }
    }

    for (int i=nr; i>=1; i--) fout << postordine[i] << ' ';
    fout << '\n';
    fout.close();
    return 0;
}