#include <bits/stdc++.h>

using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

const int NMAX = 1e5;
const int INF = 1e9;
vector<int> G[NMAX + 1];
queue<int> q;
int grad[NMAX + 1];
int n, m;

int main() {
    f >> n >> m;
    for(int i = 1; i <= m; i++) {
        int x, y;
        f >> x >> y;
        grad[y]++;
        G[x].push_back(y);
        //G[y].push_back(x); //daca avem un graf orientat linia asta dispare
    }
    for(int i = 1; i <= n; i++) {
        if(grad[i] == 0) {
            q.push(i);
        }
    }
    while(!q.empty()) {
        int node = q.front();
        q.pop();
        g << node << ' ';
        for(int i = 0; i < G[node].size(); i++) {
            int vecin = G[node][i];
            grad[vecin]--;
            if(grad[vecin] == 0) {
                q.push(vecin);
            }
        }
    }
    return 0;
}