#include <iostream>
#include <fstream>
using namespace std;

int i,n,m,k;
int viz[100],v[100];

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

struct nod{
    int nr;
    nod* urm;
} *li[100];

void df(short i){
    viz[i]=1;
    nod* u=li[i];
    while(u){
        if(viz[u->nr]==0) df(u->nr);
        if(u->urm) u=u->urm;
        else break;
    }
    v[++k]=i;
}

void link(){
    int a,b;
    f>>a>>b;
    nod* u=new nod;
    u->urm=li[a];
    u->nr=b;
    li[a]=u;
}

int main(){
    f>>n>>m;
    for(i=0;i<m;i++) link();
    for(i=1;i<=n;i++) if(!viz[i]) df(i);
    for(i=n;i;i--) g<<v[i]<<' ';g<<'\n';
    g.close();f.close();
    return 0;
}