#include <fstream>
#include <queue>
#include <vector>

#define NMAX 50000

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

vector <int> G[NMAX];
queue <int> q;
int n, m, i, x, y;
bool viz[NMAX];

void sortaret(int nod)
{
    viz[nod] = true;

    while (!q.empty())
    {
        int x = q.front();
        fout << x << " ";
        int nrvecini = G[nod].size();
        for (int i=0; i<nrvecini; i++)
        {
            if(!viz[G[nod][i]])
            {
                viz[G[nod][i]]=1;
                q.push(G[nod][i]);
            }
        }

        q.pop();
    }

}

int main()
{
    fin >> n >> m;

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

    for (i=1; i<=n; i++)
    {
        if (!viz[i])
            q.push(i), sortaret(i);
    }

    return 0;
}