#include <bits/stdc++.h>
#define Nmax 50005
using namespace std;

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

vector < int > v[Nmax];

queue <int> q;

bitset < Nmax > b;

void DFS ( int  x )
{

    fout << x <<' ';

    b[x] = 1;

    int lng =  v[x].size();

    for ( int i = 0; i < lng; i++ )
       DFS(v[x][i]);
}

int main()
{
    int n, m,x ,y ;

    fin >> n >> m;

    for ( int i = 1; i <= m; i++ )
    {
        fin >> x >> y;

        v[x].push_back(y);
    }

    for ( int i = 1; i <= n; i++ )
    if ( b[i] == 0 ) DFS( 1 );
}