#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin ("sortaret.in");
ofstream fout ("sortaret.out");
vector<int>v[50001];
int n,m,a,b,f[50001],q[50001],nr;
void dfs(int val)
{
    f[val]=1;nr++;q[nr]=val;
    for (int i=0;i<v[val].size();i++)
         if (f[v[val][i]]==0) dfs(v[val][i]);

}
int main()
{
    fin >>n>>m;
    for (int i=1;i<=m;i++)
        {fin >>a>>b;
         v[a].push_back(b);}
    for (int i=1;i<=n;i++)
         sort(v[i].begin(), v[i].end());
    for (int i=1;i<=n;i++)
        {if (f[i]==0) {dfs(i);}}
    for (int i=1;i<=nr;i++)
        {fout <<q[i]<<' ';}
    return 0;
}