#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define NMAX 50000
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector < int > graf[NMAX];
queue < int > coada;
int grad[NMAX];
int n,m;
int main()
{
    int i,a,b;
    f>>n>>m;
    for(i=1; i<=m; i++)
    {
        f>>a>>b;
        graf[a].push_back(b);
        grad[b] ++;
    }
    for(i=1; i<=n; i++)
        if(grad[i] == 0) coada.push(i);
    while(!coada.empty())
    {
        int aux = coada.front();
        g<<aux<<" ";
        coada.pop();
        int lim = graf[aux].size();
        for(i=0; i<lim; i++)
        {
            grad[graf[aux][i]]--;
            if(grad[graf[aux][i]] == 0)
                coada.push(graf[aux][i]);
        }
    }
    return 0;
}