#include <fstream>
#include <queue>
#include <vector>
#include <map>

using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
const int NMAX = 50005;

int n, m, grad[NMAX], ans[NMAX];
map<pair<int, int>, bool> mp;
vector<int> v[NMAX];
priority_queue<int, vector<int>, greater<int>> que;

int main()
{
    in >> n >> m;
    for(int i=1; i<=m; i++) {
        int x, y;
        in >> x >> y;
        if(!mp[{x, y}]) {
            v[x].push_back(y);
            grad[y]++;
            mp[{x, y}] = 1;
        }
    }

    for(int i=1; i<=n; i++)
        if(!grad[i])
            que.push(i);

    while(!que.empty()) {
        int nod = que.top();
        que.pop();

        ans[++ans[0]] = nod;
        for(int i=0; i<v[nod].size(); i++) {
            grad[v[nod][i]]--;
            if(!grad[v[nod][i]])
                que.push(v[nod][i]);
        }
    }

    for(int i=1; i<=n; i++)
        out << ans[i] << ' ';
    return 0;
}