#include <fstream>
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n, m, i, j, x, y, viz[50001];
vector <vector <int> > v;
vector <int> out;
void dfs (int start)
{
    viz[start] = 1;
    for (int i = 0; i < v[start].size(); ++i)
        if (viz[v[start][i]] == 0)
            dfs (v[start][i]);
    out.push_back(start);
}
int main()
{
    fin >> n >> m; v.resize(n+1);
    for (i = 1; i <= m; ++i)
    {
        fin >> x >> y;
        v[x].push_back(y);
    }
    for (i = 1; i <= n; ++i)
    {
        if (viz[i] == 0)
            dfs (i);
    }
    for (i = out.size()-1; i >= 0; --i)
    {
        fout << out[i] << ' ';
    }
    return 0;
}