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

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

const int NMAX = 50000 + 5;

vector <int> g[NMAX];
stack <int> s;

int n, m;
bool vis[NMAX];

void read()
{
    int x, y;
    fin >> n >> m;
    for (int i = 1; i <= m; ++i)
    {
        fin >> x >> y;
        g[x].push_back(y);
    }
}

void dfs(int nod)
{
    vis[nod] = true;
    for (int i = 0; i < g[nod].size(); ++i)
        if (!vis[g[nod][i]])
            dfs(g[nod][i]);
    s.push(nod);
}

int main()
{
    read();
    for (int i = 1; i <= n; ++i)
        if (!vis[i])
            dfs(i);
    while (!s.empty())
    {
        fout << s.top() << " ";
        s.pop();
    }
    return 0;
}