#include <cstdio>
#include <vector>
#include <queue>
using namespace std;

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