#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 )
{
    if ( viz[nod] ) return ;
    viz[nod] = true ;
    for ( int i = 0 ; i < ad[nod].size() ; ++i )
    {
            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);
    }
    sortare(1);
    for ( int i = 0 ; i < sol.size() ; ++i )
    {
        printf("%d ",sol[i]);
    }
}