#include <iostream>
#include <fstream>
#define nmax 50000
using namespace std;

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

bool viz[nmax];
int n,m,timp[nmax],k;

struct Nod
{
    int info;
    Nod *leg;
}*L[nmax];

void read()
{
    Nod *p;
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        int x,y;
        fin>>x>>y;
        p=new Nod;
        p->info=y;
        p=L[x];
        L[x]=p;
    }
    fin.close();
}

void Dfs(int x)
{
    Nod *p;
    viz[x]=1;
    for(p=L[x]; p!=NULL ; p=p->leg)
        if(! viz[p->info])
            Dfs(p->info);

    timp[++k]=x;
}

void afis()
{
    for(int i=1; i<=n; i++)
     if(!viz[i]) Dfs(i);
    for(int i=n; i>=1;i--)
        fout<<timp[i]<<" ";
}

int main()
{
    read();
    afis();
    return 0;
}