#include <fstream>
#include <vector>
#include <stack>

using namespace std;

const int N = 50000;
vector <int> succ[N + 1];
bool viz[N + 1];
stack <int> rez;

void dfs(int x)
{
    viz[x] = true;
    for (auto y: succ[x])
    {
        if (!viz[y])
        {
            dfs(y);
        }
    }
    rez.push(x);
}
int main()
{
    ifstream in("sortaret.in");
    ofstream out("sortaret.out");

    int n, m;
    in >> n >> m;
    for (int i = 0; i < m; i ++)
    {
        int x, y;
        in >> x >> y;
        succ[x].push_back(y);
    }

    for (int i = 1; i <= n; i ++)
    {
        if (!viz[i])
        {
            dfs(i);
        }
    }

    while (!rez.empty())
    {
        out << rez.top() << ' ';
        rez.pop();
    }

    in.close();
    out.close();

    return 0;
}