#include <bits/stdc++.h>

const int MAX_N = 50000;

using namespace std;

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

int n, m;
int fv[MAX_N + 5];

vector<int> vecini[MAX_N + 5], sol;
queue<int> q;

int main() {
    int n, m;
    fin >> n >> m;
    for(int i = 1; i <= m; i++) {
        int x, y;
        fin >> x >> y;
        vecini[x].push_back(y);
        fv[y]++;
    }

    for(int i = 1; i <= n; i++)
        if(fv[i] == 0)
        q.push(i);

    while(!q.empty()) {
        int u = q.front();
        q.pop();
        sol.push_back(u);

        for(int v : vecini[u]) {
            fv[v]--;
            if(fv[v] == 0)
                q.push(v);
        }
    }

    for(auto i : sol)
        fout << i << ' ';
    return 0;
}