#include <vector>
#include <fstream>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n, m;
 
vector <int> graph [50005];
int viz[50005];
 
void dfs (int node)
{
    viz[node] = 1;
    int dim = graph[node].size(); //nr vecini nod
    for(int i=0; i<dim; i++)
    {
        int vecin = graph[node][i];
        if(!viz[vecin])
            dfs(vecin);
    }
    g<<node<<" ";
}
 
int main ()
{
    f>>n>>m;
 
    for(int i=1; i<=m; i++)
    {
        int x, y; //arc (x,y)
        f>>x>>y;
        graph[x].push_back(y);
    }
 
    for(int i=1; i<=n; i++)
    {
        if (!viz[i])
            dfs(i);
    }
}