#include <bits/stdc++.h>
using namespace std;

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

int n,m;
vector < int > v[50005];
pair < int, int > gradint[50005];
bool viz[50005];
int x,y;
vector < int > nodes;
queue < int > q;

int main()
{
    f >> n >> m;
    for (int i=1;i<=n;i++) {
        gradint[i].second = i;
    }
    for (int i=1;i<=m;i++) {
        f >> x >> y;
        v[x].push_back(y);
        gradint[y].first++;
    }
    sort(gradint+1,gradint+n+1);
    for (int i=1;i<=n;i++) {
        int nodcr = gradint[i].second;
        if (viz[nodcr]==0) {
            q.push(nodcr);
        }
        while (q.empty()==0) {
            int nod = q.front();
            if (viz[nod]==0) {
                viz[nod] = 1;
                nodes.push_back(nod);
                q.pop();
                for (int j=0;j<v[nod].size();j++) {
                    int nodtoviz = v[nod][j];
                    if (nodtoviz[viz]==0) {
                        q.push(nodtoviz);
                    }
                }
            }
        }
    }
    for (int i=0;i<n;i++) {
        g << nodes[i] <<" ";
    }
    return 0;
}