#include <fstream>
#include <vector>

using namespace std;

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

int n, m, index, ord[50005];
vector <int> graph[50005];
bool visited[50005];

void dfs(int node)
{
    visited[node] = true;

    for(auto i : graph[node])
        if(visited[i] == false)
            dfs(i);

    ord[++index] = node;
}

int main()
{
    int 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(visited[i] == false)
            dfs(i);

    for(int i = n; i >= 1; i--)
        fout << ord[i] << ' ';

    return 0;
}