#include <fstream>
#include <vector>

int n,m,d[50010];
std::vector <int> v[50010];

std::ifstream f ("sortaret.in");
std::ofstream t ("sortaret.out");

inline void dfs(int nod){
d[nod]=1;
for (auto i:v[nod])
    if(d[i]==0)dfs(i);
t<<nod+1<<" ";
}

int main(){
    int x,y;
    f>>n>>m;
    for (int i=0;i<m;++i){
        f>>x>>y;
        v[y].push_back(x);
    }
    for (int i=0;i<n;++i)
        if (!d[i]) dfs(i);
return 0;
}