#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define N 100010

using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

vector<int> v[N];
queue<int> coada;
int i,j,n,k,t,p,r,x,m,y,viz[N],deg[N];
void dfs(int x)
{
    viz[x]==1;
    coada.push(x);
    for(int k=0;k<v[x].size();k++)
    {
        if(deg[v[x][k]]==0 && viz[j]==0)
            dfs(v[x][k]);
    }
}
int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        v[x].push_back(y);
        deg[x]++;
    }
    for(i=1;i<=n;i++)
        if(deg[i]!=0)
        dfs(i);
    while(!coada.empty())
    {
        g<<coada.front()<<' ';
        coada.pop();
    }
}