#include <fstream>
#include <vector>
#include <queue>
#include <stack>

using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,s,v[100005];

vector <int>graf[100005];
queue <int>q;
stack <int>stk;

void citire(){
    f>>n>>m;
    int x,y;
    for(int i=1;i<=m;i++){
        f>>x>>y;
        graf[x].push_back(y);
    }
}

void dfs(int nod){
    v[nod]=1;
    for(auto&a:graf[nod]){
        if(v[a]){
            v[a]=1;
            dfs(a);
        }
    }
    stk.push(nod);
}

int main()
{
    citire();
    for(int i=1;i<=n;i++){
        if(!v[i])
            dfs(i);
    }
    while(!stk.empty()){
        g<<stk.top()<<" ";
        stk.pop();
    }
}