#include<cstdio>
#include<vector>
#include<queue>
using namespace std;
int n,m,a,b,nod,grad[50001];
vector<int>v[50001];
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",&a,&b);
        grad[b]++;
        v[a].push_back(b);
    }
    for(int i=1;i<=n;i++)
        if(grad[i]==0){
            Q.push(i);
        }
    while(!Q.empty()){
        nod=Q.front();
        Q.pop();
        printf("%d ",nod);
        for(int i=0;i<v[nod].size();i++){
            grad[v[nod][i]]--;
            if(grad[v[nod][i]]==0)
                Q.push(v[nod][i]);
        }
    }
    return 0;
}