#include <cstdio>
#include <queue>
#define pb push_back
using namespace std;

const int nmx = 50002;

int n,m,parinti[nmx];
vector <int> g[nmx];
queue <int> q;

int main() {
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);

    scanf("%d %d", &n, &m);
    int nod1,nod2;
    for(int i = 1; i <= m; ++i) {
        scanf("%d %d", &nod1, &nod2);
        g[nod1].pb(nod2);
        ++ parinti[nod2];
    }

    for(int i = 1; i <= n; ++i)
        if(not parinti[i]) {
            parinti[i] = -1;
            q.push(i);
        }

    int nod;
    while(not q.empty()){
        nod = q.front();
        printf("%d ", nod);
        q.pop();
        for(vector<int>::iterator it = g[nod].begin(); it != g[nod].end(); ++it){
            -- parinti[*it];
            if(not parinti[*it]){
                parinti[*it] = -1;
                q.push(*it);
            }
        }
    }

    return 0;
}