#include <fstream>

using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
struct nod
{
    int val;
    nod *urm;
};
typedef nod *pnod;
pnod v[50003],p;
bool use[50003];
int stiva[50003],st;
void ad(int x,int y)
{
    p=new nod;
    p->val=y;
    p->urm=v[x]->urm;
    v[x]->urm=p;
}
int n,m;
void dfs(int i)
{
    pnod p;

    p=v[i]->urm;
    while(p)
    {
        if(use[p->val]==0)
        {
            use[p->val]=1;
            dfs(p->val);
        }
        p=p->urm;
    }
    st+=1;
    stiva[st]=i;
}
int main()
{
    int i,x,y,j;

    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)
        {
            use[i]=1;
            dfs(i);

           // g<<'\n';
        }
    }
      for(j=st;j>=1;j--)
            {
                g<<stiva[j]<<" ";
            }
    return 0;
}