#include <cstdio>
#include <vector>

using namespace std;

#define Nmax 100050
vector <int> sol;
vector <int> ad[Nmax] ;
bool viz[Nmax] ;
int n , m , x, y;

void sortare ( int nod )
{
    for ( int i = 0 ; i < ad[nod].size() ; i++ )
    {
        if ( viz[ad[nod][i]] == 0 )
        {
            viz[ad[nod][i]] = 1 ;
            sortare(ad[nod][i]) ;
        }

    }
    sol.push_back(nod);
}

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

    scanf("%d %d",&n,&m);
    for ( int i = 1 ; i <= m ; i++ )
    {
        scanf("%d %d",&x,&y);
        ad[x].push_back(y);
    }
    for ( int i = 1 ; i <= n ; i++ )
    {
        if ( viz[i] == 0 )
        {
            viz[i] = 1 ;
            sortare(i) ;
        }
    }
    for ( int i = sol.size() - 1 ; i >= 0; i-- )
    {
        printf("%d ",sol[i]);
    }
    return 0 ;
}