#include <stdio.h>
#include <vector>
#include <queue>
using namespace std;
vector<int>v[50001];
queue<int>q;
bool viz[50001];
int n,m;

void bfs(int x){
    q.push(x);
    for(int i=0;i<v[x].size();i++)
    if(!viz[v[x][i]]){
        viz[v[x][i]]=1;
        bfs(v[x][i]);}
}

int main(){
    int x,y;
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
        scanf("%d %d",&n,&m);
        for(int i=1;i<=m;i++){
            scanf("%d %d",&x,&y);
            v[x].push_back(y); }
        for(int i=1;i<=n;i++)
        if(!viz[i]){
            viz[i]=1;
            bfs(i);}
    while(q.size()>0){
        printf("%d ",q.front());
        q.pop(); }
}