#include <fstream>
#include <vector>
using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

int  n, m, topo[50000], K;
vector<int> a[100000];

void Solve(int nod)
{
    topo[K++]=nod;
   for(int i=0;i<a[nod].size();++i)
        Solve(a[nod][i]);

}

int main()
{
    f>>n>>m;
    for(int i=0;i<m;++i)
    {
        int aux, aux2;
        f>>aux>>aux2;
        a[aux].push_back(aux2);
    }

    Solve(1);

    for(int i=0;i<n;++i)
        g<<topo[i]<<' ';

    return 0;
}