#include <fstream>
#include<vector>
#include<algorithm>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector <int> L[100001];
int viz[100001],n,m,st[100001],varf;
void DFS(int k)
{int j;
    //g<<k<<" ";
    viz[k]=1;
    for(j=0;j<L[k].size();j++)
        if(viz[L[k][j]]==0) DFS(L[k][j]);
    st[++varf]=k;
}
void sort_top()
{
    for(int i=1;i<=n;i++)
        if(viz[i]==0)DFS(i);
}
int main()
{
    int i,x,y,j;
    f>>n>>m;
    for (i=1;i<=m;i++)
    {
        f>>x>>y;
        L[x].push_back(y);
        //L[y].push_back(x);
    }
    for (i=1 ; i<=n ; i++)
  {
    sort(L[i].begin(),L[i].end());
        for (j=1 ; j < L[i].size() ; j++)
        if(L[i][j-1]==L[i][j]){L[i].erase(L[i].begin()+j);j--;}
  }
    sort_top();
    for(i=n;i>=1;i--)g<<st[i]<<" ";
    g<<'\n';
    f.close();
    g.close();
    return 0;
}