#include <bits/stdc++.h>

using namespace std;

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

struct Nod
{
    int info;
    Nod *next;
};

Nod *lista[50001], *head;
int n, m, x, y, v[500001], k;
bool viz[50001];

void Adauga(Nod **p,int x)
{
    Nod *nou;
    nou=(Nod*)malloc(sizeof(Nod));
    nou->info=x;
    nou->next=*p;
    *p=nou;
}

void DF(int nod)
{
    Nod *p;
    viz[nod]=true;
    for(p=lista[nod];p!=NULL;p=p->next)
        if(!viz[p->info]) DF(p->info);
    Adauga(&head,nod);
}

int main()
{
    f>>n>>m;
    for(int i=1;i<=m;i++)
    {
        f>>x>>y;
        Adauga(&lista[x],y);
    }
    for(int i=1;i<=n;i++)
        if(!viz[i]) DF(i);
    Nod *p;
    for(p=head;p!=NULL;p=p->next) g<<p->info<<" ";
    return 0;
}