#include<cstdio>
#include<vector>
#define MAX 50001
using namespace std;
bool viz[MAX];
vector < int > v[MAX],sol;
int n;
void DFS(int x){
    int vf,i;
    viz[x]=1;
    for(i=0;i<(int)v[x].size();++i){
        vf=v[x][i];
        if(!viz[vf])
            DFS(vf);
    }
    sol.push_back(x);
}
void tsort(){
    int i;
    for(i=1;i<=n;++i)
        if(!viz[i])
            DFS(i);
}
int main(){
    int x,y,i,m;
    freopen("sortaret.in","r",stdin);
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;++i){
        scanf("%d%d",&x,&y);
        v[x].push_back(y);
    }
    fclose(stdin);
    tsort();
    freopen("sortaret.out","w",stdout);
    for(i=(int)sol.size()-1;i>=0;i--)
        printf("%d ",sol[i]);
    printf("\n");
    return 0;
}