#include <iostream>
#include <fstream>

using namespace std;

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

const int N=50002;
const int M=100002;
int lst[N],urm[M],pred[N],vf[M],nr,q[N];
bool viz[N];

void adauga (int x, int y)
{
    vf[++nr]=y;
    urm[nr]=lst[x];
    lst[x]=nr;
}
void dfs (int nod)
{
    viz[nod]=true;
    for (int p=lst[nod];p!=0;p=urm[p])
    {
        int y=vf[p];
        if (!viz[y])
            dfs (y);
    }
    q[++nr]=nod;
}
int main()
{
    int x,y,n,m;
    in>>n>>m;
    for (int i=1;i<=m;i++)
    {
        in>>x>>y;
        adauga (x,y);
        //pred[y]++;
    }
    nr=0;
    for (int i=1;i<=n;i++)
        if (!viz[i])
            dfs (i);

    for (int i=n;i>=1;i--)
        out<<q[i]<<' ';
    return 0;
}