#include <fstream>
#include <vector>
#define nmax 100001
using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

vector<int> G[nmax];
int viz[nmax], sol[nmax] ,grad[nmax], n, m, nr;

void dfs(int x)
{ int i;
  viz[x]=1;
  for(vector<int>::iterator it=G[x].begin();it!=G[x].end();it++)
     if(viz[*it]==0){
     dfs(*it);
  }
  sol[++nr]=x;

}

int main()
{ int i, x, y;
    f>>n>>m;
     for(i=1;i<=m;i++){
        f>>x>>y;
        G[x].push_back(y);
        grad[y]++;
     }
     for(i=1;i<=n;i++)
        if(grad[i]==0)
          dfs(i);
        for(i=nr;i>=1;i--)
            g<<sol[i]<<' ';
}