#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
vector < vector < int > > v(50001);
bool c[50001];
int zz,m,n,x,y;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
int sol[50001];
void dfs(int k)
{
    zz++;
    sol[zz]=k;
    c[k]=1;
    int f=v[k].size();
    for(int i=0;i<f;i++)
        if(c[v[k][i]]==0)
           dfs(v[k][i]);
}
int main()
{
    in>>n>>m;
    for(int i=1; i<=m; i++)
    {
        in>>x>>y;
        v[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
        if(c[i]==0)
          dfs(i);
    for(int j=1;j<=zz;j++)
        out<<sol[j]<<" ";

}