#include <fstream>
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int f[50010],s[50010],i,n,m,x,y,ok[50010],k;
vector<int> L[50010];
void dfs(int nod){
    f[nod]=1;
    for(int j=0;j<L[nod].size();j++){
        int vec=L[nod][j];
        if(f[vec]==0)
            dfs(vec);
    }
  s[++k]=nod;
}
int main(){
    fin>>n>>m;
    for(i=1;i<=m;i++){
        fin>>x>>y;
        ok[y]=1;
        L[x].push_back(y);
    }
    for(i=1;i<=n;i++)
        if(ok[i]==0)
            dfs(i);
     for(i=k;i>=1;i--)
         fout<<s[i]<<" ";
    return 0;
}