#include <fstream>
#define  N 50001
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int n,m,g[N],nr,v[N];
struct nod
{
  int info;
  nod *urm;
};
nod *G[N];
 
void Add(nod*&prim, int x)
{
    nod *q=new nod;
    q->info=x;
    q->urm=prim;
    prim=q;
}
 
void Citire()
{
    int x,y;
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y;
        Add(G[x],y);
        g[y]++;
    }
}

int main()
{

    Citire();
    while(nr<n)
    {
        for(int i=1;i<=n;i++)
           if(g[i]==0)
            {
                v[++nr]=i;
                for(nod *p=G[i];p!=NULL;p=p->urm)
                   g[p->info]--;
            }
    }
    for(int i=1;i<=n;i++)
     fout<<v[i]<<" ";
    return 0;
}