#include <bits/stdc++.h>
#define NMAX 50001
#define MMAX 100001
using namespace std;

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

int n, m, nr, vf[MMAX*2], urm[MMAX*2], last[NMAX], top[NMAX], t;
bitset <NMAX> viz;

void adauga(int nod, int v)
{
    vf[++nr] = v;
    urm[nr] = last[nod];
    last[nod] = nr;
}

void citire()
{
    fin>>n>>m;
    for(int i, j, k = 1; k<=m; k++)
    {
        fin>>i>>j;
        adauga(i, j);
    }

}

void dfs(int nod)
{
    viz[nod] = 1;

    for(int k = last[nod]; k; k = urm[k])
        if(!viz[vf[k]])
            dfs( vf[k] );

    top[t--] = nod;
}


int main()
{
    citire();
    t = n;
    for(int i=1; i<=n; i++)
        if(!viz[i])
            dfs(i);

    for(int i=1; i<=n; i++)
        fout<<top[i]<<' ';

    return 0;
}