#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
const int nmax = 50005;
vector < int > Muchii[nmax*2];
vector < int > sol;
int n, m, x, y;
bool viz[nmax];

void DFS (int Nod) {
    sol.push_back(Nod);
    viz[Nod]=true;
    for(unsigned i=0; i<Muchii[Nod].size(); ++i) {
        int v = Muchii[Nod][i];
        if(!viz[v]) DFS(v);
    }
}
int main()
{
    fin >> n >> m;
    for(int i=1; i<=m; ++i) {
        fin >> x >> y;
        Muchii[x].push_back(y);
    }
    for(int i=1; i<=n; ++i) {
        if(!viz[i]) DFS(i);
    }
    for (unsigned i=0; i<sol.size(); ++i) {
        fout << sol[i] << ' ' ;
    }
    return 0;
}