#include <bits/stdc++.h>
using namespace std;

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

const int MAX_SIZE = 5 * 1e4;
int n, m;
vector<int> graph[MAX_SIZE + 1], inArches(MAX_SIZE + 1, 0);
vector<bool> visited(MAX_SIZE + 1, false);

void depthFirstSearch(int start, vector<int>& topologicalSorted) {
    stack<int> nodes;
    nodes.push(start);
    while (!nodes.empty()) {
        int currentNode = nodes.top();
        nodes.pop();
        if (!visited[currentNode]) {
            visited[currentNode] = true;
            topologicalSorted.push_back(currentNode);
            for (int neighbor : graph[currentNode]) {
                if (!visited[neighbor]) {
                    nodes.push(neighbor);
                }
            }
        }
    }
}

int main() {
    fin >> n >> m;
    for (int i = 0; i < m; ++i) {
        int x, y;
        fin >> x >> y;
        graph[x].push_back(y);
        ++inArches[y];
    }
    int start;
    for (int i = 1; i <= n; ++i) {
        if (inArches[i] == 0) {
            start = i;
            break;
        }
    }
    vector<int> topologicalSorted;
    depthFirstSearch(start, topologicalSorted);
    for (int node : topologicalSorted) {
        fout << node << " ";
    }
    return 0;
}