#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f ("sortaret.in");
ofstream g ("sortaret.out");
vector<int>adiacenta[50001];
int n,m;
bool viz[50001];
int intrari[50001];
queue<int>q;
void DFS(int nod)
{
    viz[nod] = 1;
    for(auto x:adiacenta[nod])
    {
        if(!viz[x])
        {
            DFS(x);
        }
    }
}
int main()
{
    f >> n >> m;
    for(int i = 1;i<=m;i++)
    {
        int x,y;
        f >> x >> y;
        adiacenta[x].push_back(y);
        intrari[y]++;
    }
    for(int i =1;i<=n;i++)
    {
        if(intrari[i] == 0)
            q.push(i);
    }
    while(!q.empty())
    {
        int curent = q.front();
        q.pop();
        g << curent<< " ";
        for(auto x:adiacenta[curent])
        {
            intrari[x]--;
            if(!intrari[x])
                q.push(x);
        }
    }

}