#include <bits/stdc++.h>
#define dim 50005
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m;
bool viz[dim];
vector <int> graph[dim],sol;
void read()
{
    f>>n>>m;
    for(int i=1; i<=m; i++)
    {
        int x,y;
        f>>x>>y;
        graph[x].push_back(y);
    }
}
void TopSort(int node)
{
    viz[node]=1;
    for(int i=0; i<graph[node].size(); ++i)
        if(!viz[graph[node][i]])
            TopSort(graph[node][i]);
    sol.push_back(node);
}
int main()
{
    read();
    for(int i=1; i<=n; ++i)
        if(!viz[i])
            TopSort(i);
    for(int i=sol.size()-1; i>=0; --i)
        g<<sol[i]<<" ";
    return 0;
}