#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

struct nod {int info; nod *urm;};
nod *vec[50001], *rez;
bool viz[50001];
int n,m;

void add(nod *&dest, int val)
{
    nod *p;
    p=new nod;
    p->info=val;
    p->urm=dest;
    dest=p;
}

void citire()
{
    int x,y;
    fin>>n>>m;
    while (m--)
    {
        fin>>x>>y;
        add(vec[x],y);
    }
}

void DFS(int nrNod)
{
    viz[nrNod]=true;
    for (nod *i=vec[nrNod]; i; i=i->urm)
        if (!viz[i->info]) DFS(i->info);
    add(rez,n--);
}

int main()
{
    citire();
    for (int i=1; i<=n; ++i)
        if (!viz[i]) DFS(i);
    for (nod *i=rez; i; i=i->urm)
        fout<<i->info<<' ';
    return 0;
}