#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

int n, m, i, a, b, f[50003], p, u, c[50003], crt;
vector<int> v[50004];

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int main(){
    fin>>n>>m;
    for(i=1;i<=m;i++){
        fin>>a>>b;
        v[a].push_back(b);
        f[b]++;
    }
    for(i=1;i<=n;i++)
        if(f[i] == 0){
            /// bfs
            p = u = 1;
            c[1] = i;
            fout<<i<<" ";
            while(p <= u){
                crt = c[p];
                sort(v[crt].begin(), v[crt].end());
                for(int j = 0;j<v[crt].size();j++){
                    fout<<v[crt][j]<<" ";
                    c[++u] = v[crt][j];
                }
                p++;
            }
            return 0;
        }
    return 0;
}