#include<fstream>
#include<vector>
#include<deque>

using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n, m, x, y;
vector < int > v[50005];
deque < int > q;
bool viz[50005];

void dfs(int nod)
{
    viz[nod] = 1;
    for (int i = 0; i < v[nod].size(); i++)
        if(viz[v[nod][i]] == 0)
            dfs(v[nod][i]);
    q.push_back(nod);
}

int main()
{
    f >> n >> m;
    while (m--)
    {
        f >> x >> y;
        v[x].push_back(y);
    }
    for (int j = 1; j <= n; j++)
        if (viz[j] == 0)
            dfs(j);
    while (!q.empty())
    {
        g << q.back() << " ";
        q.pop_back();
    }
}