#include <fstream>
#include <vector>

using namespace std;

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

using Graph = vector<Node>;

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

vector<int> TopoSort(Graph &g)
{
    vector<int> order;
    for (size_t i = 0; i < g.size(); i += 1) {
        if (!g[i].used) {
            Dfs(g, i, order);
        }
    }
    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 a, b;
        fin >> a >> b;
        graph[b - 1].edges.push_back(a - 1);
    }

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

    return 0;
}