#include <fstream>
#include <vector>
#include <queue>
using namespace std;
vector<int>v[50003];
queue<int>c;
int grad[50003],i,n,m,x,y;
bool viz[50003];
int main()
{
    ifstream fi("sortaret.in");
    ofstream fo("sortaret.out");
    fi>>n>>m;
    for(i=1;i<=m;i++)
    {
      fi>>x>>y;
      v[x].push_back(y);
      grad[y]++;
    }
    for(i=1;i<=n;i++)
    if(grad[i]==0)
      {
        c.push(i);
        viz[i]=1;
      }
    while(!c.empty())
    {
      x=c.front();
      c.pop();
      m=v[x].size();
      for(i=0;i<m;i++)
      if(!viz[v[x][i]])
      {
        grad[v[x][i]]--;
        if(!grad[v[x][i]]&&!viz[v[x][i]]) { c.push(v[x][i]); viz[v[x][i]]=1; }

      }
      fo<<x<<" ";
    }
    for(i=1;i<=n;i++)
    if(!viz[i]) fo<<x<<" ";
    fo<<"\n";
    fo.close();
    return 0;
}