#include <cstdio>
#include <vector>
using namespace std;
#define MAX 50001
vector <int> vad[MAX];
int n, m, v[MAX], prim=1, ult, grad[MAX];
int main()
{
    int i, source, dest;
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);
    scanf("%d%d", &n, &m);
    for(i=1; i<=m; i++){
        scanf("%d%d", &source, &dest);
        grad[dest]++;
        vad[source].push_back(dest);
    }
    for(i=1; i<=n; i++)
        if(grad[i]==0)
            v[++ult]=i;
    while(prim<=ult){
        vector <int>::iterator it;
        for(it=vad[v[prim]].begin(); it<vad[v[prim]].end(); it++){
            grad[*it]--;
            if(grad[*it]==0)
                v[++ult] = *it;
        }
        prim++;
    }
    for(i=1; i<=ult; i++)
        printf("%d ", v[i]);
    return 0;
}