#include <fstream>
#include <vector>
#include <queue>
using namespace std;

ifstream cin("sortaret.in");
ofstream cout("sortaret.out");

vector<vector<int>> la;
queue<int> q;
vector<int> indegrees;

void sortare_topologica(int n) {
    for(int i = 1; i <= n; i++)
        if(indegrees[i] == 0) {
            q.push(i);
        }

    while(!q.empty()) {
        int curr = q.front();
        cout << curr << ' ';
        q.pop();
        for(int neighbour : la[curr]) {
            indegrees[neighbour]--;
            if(indegrees[neighbour] == 0) {
                q.push(neighbour);
            }
        }
    }
}

int main() {
    int n, m, x, y;
    cin >> n >> m;
    la.assign(n + 1, {});
    indegrees.assign(n + 1, 0);
    for(int i = 0; i < m; i++)
    {
        cin >> x >> y;
        la[x].push_back(y);
        indegrees[y]++;
    }

    sortare_topologica(n);
    return 0;
}