#include <iostream>
#include <fstream>
#include <vector>
#define fin "sortaret.in"
#define fout "sortaret.out"
#define len 50001
#define pb push_back

using namespace std;
ifstream in(fin);
ofstream out(fout);
vector<int> v[len];
int N, M, x, y;
bool car[len];
void f(int nod)
{
    out << nod << ' ';
    car[nod] = 1;
    for(int k = 0; k < v[nod].size(); ++k)
        if(!car[v[nod][k]])
            f(v[nod][k]);
}
int main()
{
    in >> N >> M;
    for(int i = 0; i < M; ++i)
    {
        in >> x >> y;
        v[x].pb(y);
    }
    for(int i = 1; i <= N; ++i)
        if(!car[i])
            f(i);
    return 0;
}