#include <fstream>
#include <vector>

using namespace std;

struct Node
{
    bool used = false;
    vector<int> edges;
};

using Graph = vector<Node>;

void Dfs(Graph &graph, int node, vector<int> &order, int &index)
{
    graph[node].used = true;
    for (const auto &next : graph[node].edges) {
        if (!graph[next].used) {
            Dfs(graph, next, order, index);
        }
    }

    order[index] = node;
    index -= 1;
}

vector<int> FindOrder(Graph &graph)
{
    vector<int> order(graph.size());
    int index = graph.size() - 1;

    for (size_t i = 0; i < graph.size(); i += 1) {
        if (!graph[i].used) {
            Dfs(graph, i, order, index);
        }
    }
    return order;
}

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

    int nodes, edges;
    fin >> nodes >> edges;

    Graph graph(nodes);
    for (int i = 0; i < edges; i += 1) {
        int x, y;
        fin >> x >> y;
        graph[x - 1].edges.push_back(y - 1);
    }

    auto order = FindOrder(graph);
    for (const auto &node : order) {
        fout << node + 1 << " ";
    }
    fout << "\n";

    return 0;
}