#include <fstream>
#include <vector>
#include <bitset>
using namespace std;
vector <int> v[50001];
int sol[50001], n, m, i, x, y, k;
bitset <50001> viz;
void dfs(int x)
{
    viz[x] = 1;
    for(vector <int> :: iterator it = v[x].begin(); it != v[x].end(); ++ it)
        if(viz[*it] == 0)
         dfs(*it);
    sol[++ k] = x;
}
int main()
{
    ifstream f("sortaret.in");
    ofstream g("sortaret.out");
    f >> n >> m;
    for(i = 1; i <= m; ++ i)
    {
        f >> x >> y;
        v[x].push_back(y);
    }
    for(i = 1; i <= n; ++ i)
        if(viz[i] == 0)
         dfs(i);
    for(i = k; i >= 1; -- i)
        g << sol[i] << " ";
    return 0;
}