#include <fstream>
#include <vector>
#include <queue>
using namespace std;
#define MAXN 50001
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");

int n,m,i,j,x,y;
vector<int> graf[MAXN];
queue<int> coada;
int depinde[MAXN];

void dfs()
{
    int nod,i;
    while(!coada.empty())
    {
        nod=coada.front(); coada.pop();
        for(i=0; i<graf[nod].size(); i++)
        {
            depinde[graf[nod][i]]--;
            if(!depinde[graf[nod][i]])
                coada.push(graf[nod][i]);
        }
        cout<<nod<<" ";
    }
}
int main()
{
    cin>>n>>m;
    for(i=1; i<=m; i++)
    {
        cin>>x>>y;
        depinde[y]++;
        graf[x].push_back(y);
    }
    for(i=1; i<=n; i++)
        if(!depinde[i])
            coada.push(i);
    dfs();

}