#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n, m, grad[50010];
vector<int>graf[50010];
queue<int>Q;
void citire()
{
    f>>n>>m;
    int x, y;
    for(int i=0; i<m; i++)
    {
        f>>x>>y;
        graf[x].push_back(y);
        grad[y]++;
    }
}
void bfs()
{
    while(!Q.empty())
    {
        int x=Q.front();
        Q.pop();
        for(auto &v:graf[x])
        {
            grad[v]--;
            if(grad[v]==0)
                Q.push(v);
        }
        g<<x<<' ';
    }
}
int main()
{
    citire();
    for(int i=1; i<=n; i++)
        if(grad[i]==0)
            Q.push(i);
    bfs();
    return 0;
}