#include <bits/stdc++.h>

using namespace std;

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

bool viz[100000];
int n,x,y,m;
vector<int>v[50000];
deque <int >Q;


void dfs(int nod){


    viz[nod]=1;
    for(int i=0;i<v[nod].size();i++){
        if(!viz[v[nod][i]]){
            viz[v[nod][i]]=1;
            Q.push_back(v[nod][i]);
            dfs(v[nod][i]);
        }
    }

}

int main()
{
    in>>n>>m;
    for(int i=1;i<=m;i++){
        in>>x>>y;
        v[x].push_back(y);

    }
    for(int i=1;i<=n;i++)
        if(viz[i]==0)
        {
            Q.push_back(i);
            dfs(i);
        }
    for(int i=0;i<Q.size();i++)
        out<<Q[i]<<" ";


    return 0;
}