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

ifstream fin ("sortaret.in");
ofstream fout ("sortaret.out");
vector<int> v[50001];

void dfs(int node) {
    fout << node << " ";
    for (vector<int>::iterator it = v[node].begin(); it != v[node].end(); it++)
        dfs(*it);
}

int main() {
    fin.tie(0);
    ios::sync_with_stdio(0);
    int n, m;
    fin >> n >> m;
    bool inDegree[n + 1] = {0};
    int a, b;
    for (int i = 0; i < m; i++) {
        fin >> a >> b;
        v[a].push_back(b);
        inDegree[b] = true;
    }

    int startNode;
    for (int i = 1; i <= n; i++)
        if (!inDegree[i]) {
            startNode = i;
            break;
        }

    dfs(startNode);
    return 0;
}