#include<fstream>
#include<list>
#include<stack>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
const int Nmax = 50005;
list<int>l[Nmax];
stack<int>s;
bool viz[Nmax];
int n, m;
void citire(){
    f >> n >> m;
    int x, y;
    for(int i = 1; i <= m; i++){
        f >> x >> y;
        l[x].push_back(y);
    }
}
void dfs(int nc){
    viz[nc] = true;
    list<int> :: iterator it;
    for(it = l[nc].begin(); it != l[nc].end(); it++)
        if(!viz[*it])
            dfs(*it);
    s.push(nc);
}
void afisare(){
    while(!s.empty()){
        g << s.top() << ' ';
        s.pop();
    }
}
int main(){
    citire();
    dfs(1);
    afisare();
    return 0;
}