#include <fstream>

using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
#define nmax 50005
struct nod
{
    int val;
    nod *urm;
};
typedef nod *pnod;
pnod p,v[nmax];
void ad(int x,int y)
{
    p=new nod;
    p->val=y;
    p->urm=v[x]->urm;
    v[x]->urm=p;
}
int t[nmax],to;
bool use[nmax];
void dfs(int inc)
{
    use[inc]=1;
    pnod p=v[inc]->urm;
    while(p)
    {
        if(!use[p->val])
            dfs(p->val);
        p=p->urm;
    }
    to+=1;
    t[to]=inc;
}
int main()
{
    int i,n,m,j,x,y;
    f>>n>>m;
    for(i=1;i<=n;i++)
    {
        v[i]=new nod;
        v[i]->urm=0;
    }
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        ad(x,y);
    }
    for(i=1;i<=n;i++)
    {
        if(use[i]==0)
        {
            dfs(i);
        }
    }
    for(i=n;i>=1;i--)
        g<<t[i]<<" ";
    return 0;
}