#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
int pred[50005];
vector<int> v[50005];
queue<int> q;
int main()
{   freopen("sortaret.in", "r",stdin);
    freopen("sortaret.out", "w",stdout);
    int n,i,x,m,y;
    scanf("%d%d", &n, &m);
    for(i=1; i<=m; i++){
        scanf("%d%d", &x, &y);
        v[x].push_back(y);
        pred[y]++;
    }
    for(i=1; i<=n; i++)
        if(pred[i]==0)
            q.push(i);
    vector<int>::iterator it;
    while(!q.empty()){
        printf("%d ", q.front());
        for(it=v[q.front()].begin(); it!=v[q.front()].end(); it++){
            pred[*it]--;
            if(pred[*it]==0)
                q.push(*it);
        }
        q.pop();
    }
    return 0;
}