# include <fstream>
# include <algorithm>
# include <vector>
# include <queue>
# include <cstring>
# define NR 50005
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
queue <int> q;
vector <int> v[NR];
int i,j,n,m,x,y,VV;
int ap[NR], sol[NR], grad[NR];
void sortaret ()
{
    int i,k;
    while (! q.empty())
    {
        k=q.front(); q.pop();
        sol[++VV]=k;
        for (i=0; i<v[k].size(); ++i)
        {
            --grad[v[k][i]];
            if (grad[v[k][i]]==0) q.push(v[k][i]);
        }
    }
}
int main ()
{
   f>>n>>m;
   for (i=1; i<=m; ++i)
   {
       f>>x>>y;
       v[y].push_back(x);
       ++grad[x];
   }
    for (i=1; i<=n; ++i)
        if (grad[i]==0) q.push(i);
    sortaret ();
    for (i=n; i>=1; --i)
        g<<sol[i]<<" ";

    return 0;
}