#include <algorithm>
#include <vector>
#include <queue>
using namespace std;

#define pb push_back
#define DIM 50005

vector <int> g[DIM];
queue <int> q;
int grd[DIM];
int n,m;

void read ()
{
    int i,x,y;

    scanf ("%d%d",&n,&m);
    for (i=1; i<=m; ++i)
    {
        scanf ("%d%d",&x,&y);
        g[x].pb (y);
        ++grd[y];
    }
}

void solve ()
{
    vector <int> :: iterator it;
    int nod;

    for (nod=1; nod<=n; ++nod)
        if (!grd[nod])
            q.push (nod);
    for ( ; !q.empty (); q.pop ())
    {
        printf ("%d ",q.front ());
        nod=q.front ();
        for (it=g[nod].begin (); it!=g[nod].end (); ++it)
            if (--grd[*it]==0)
                q.push (*it);
    }
}

int main ()
{
    freopen ("sortaret.in","r",stdin);
    freopen ("sortaret.out","w",stdout);

    read ();
    solve ();

    return 0;
}