#include <iostream>
#include <cstdio>
#include <queue>
#define nmx 50005
using namespace std;

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

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

int main(){
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);
    scanf("%d %d", &n, &m);
    for(; m; --m){
        int nod1, nod2;
        scanf("%d %d", &nod1, &nod2);
        g[nod1].push_back(nod2);
        ++tati[nod2];
    }
    for(int i = 1; i <= n; ++i)
        if(not tati[i])
            q.push(i);
    sortare_topologica();
    return 0;
}