#include <fstream>
#include <vector>

using namespace std;
vector<int> graph[50005];
int vis[50005], v[50005], cnt;
void dfs(int node)
{
    vis[node] = true;
    for (int j = 0; j < graph[node].size(); j++)
    {
        int next = graph[node][j];
        if (!vis[next])
            dfs(next);
    }
    v[++cnt] = node;
}

int main()
{
    ifstream fin("sortaret.in");
    ofstream fout("sortaret.out");
    int N, M, x, y;
    fin >> N >> M;
    for (int i = 1; i <= M; i++)
    {
        fin >> x >> y;
        graph[x].push_back(y);
    }
    for (int i = 1; i <= N; i++)
        if (!vis[i])
            dfs(i);
    for (int i = cnt; i >= 1; i--)
        fout << v[i] << " ";
    return 0;
}