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

using namespace std;

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

int n, m;

bool used[50005];

vector < int > v[50005];

stack < int > s;

void TopSort (int nod)
{
    used[nod] = 1;

    for (int i=0; i<v[nod].size(); i++)
    {
        int vecin = v[nod][i];
        if (!used[vecin]) TopSort(vecin);
    }

    s.push(nod);
}

void Print ()
{
    while (!s.empty())
    {
        g << s.top() << " ";
        s.pop();
    }
}

int main()
{
    f >> n >> m;
    for (int i=1; i<=m; i++)
    {
        int x, y;
        f >> x >> y;
        v[x].push_back(y);
    }

    for (int i=1; i<=n; i++)
        if (!used[i]) TopSort(i);

    Print();
    return 0;
}