#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector <int> parentList[100001];
bitset <100001> reached;

void dfs(int current) {
    reached[current] = 1;
    for (int parent : parentList[current])
        if (!reached[parent])
            dfs(parent);
    fout << current << " ";
}

int main() {
    int n, m;

    fin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int a,b;
        fin >> a >> b;
        parentList[a].push_back(b);
    }

    for (int i = 1; i <= n; i++)
        if (!reached[i])
            dfs(i);

    return 0;
}