#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#define Nmax 50001
using namespace std;

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

vector<int> graf[Nmax];
queue<int> sol;
//bool viz[Nmax];
int d_interior[Nmax];
int n;
int m;

/*bool cauta_element(int x, int y)
{
    auto it = find(graf[x].begin(), graf[x].end(), y);
    if(it != graf[x].end())
        return true;
    else
        return false;
}*/

void citire()
{
    int x, y;
    fin >> n >> m;
    for(int i = 0; i < m; i++)
    {
        fin >> x >> y;
        //if(!cauta_element(x, y))
        //{
            d_interior[y]++;
            graf[x].push_back(y);
        //}
    }
}

void BFS(int i)
{
    unsigned int l = graf[i].size();
    for(unsigned int j = 0; j < l; j++)
    {
        d_interior[graf[i][j]]--;
        if(d_interior[graf[i][j]] == 0)
            sol.push(graf[i][j]);
    }
}

void rezolvare()
{
    for(int i = 1; i <= n; i++)
        if(d_interior[i] == 0)
            sol.push(i);
    while(!sol.empty())
    {
        fout << sol.front() << ' ';
        BFS(sol.front());
        sol.pop();
    }
}

int main()
{
    citire();
    rezolvare();
    return 0;
}