#include <cstdio>
#include <vector>
#include <queue>
#define MAX 50001
using namespace std;

vector<int>U[MAX];
queue<int>Q;
int n,m;
bool viz[MAX];

void bfs(int x){
    viz[x]=1;
    Q.push(x);
    while(Q.size()>0){
        x=Q.front();
        printf("%d ",x);
        for(int i=0;i<U[x].size();i++)
        if(viz[U[x][i]]==0)
        {
            Q.push(U[x][i]);
            viz[U[x][i]]=1;
        }
        Q.pop();
    }
}

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);
            U[x].push_back(y);
        }
    for(int i=1;i<=n;i++)
    if(viz[i]==0)bfs(i);
}