#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
const int Nmax=50005;
queue<int>q;
vector<int>succesor[Nmax];
int pred[Nmax];
int sol[Nmax];
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    int n,r,i,x,y,k=0;
    scanf("%d %d",&n,&r);
    for(i=1;i<=r;i++){
        scanf("%d %d",&x,&y);
        pred[y]++;
        succesor[x].push_back(y);
    }
    for(i=1;i<=n;i++)
        if(pred[i]==0)
            q.push(i);
    while(!q.empty()){
        x=q.front();
        for(i=0;i<succesor[x].size();i++){
            pred[succesor[x][i]]--;
            if(!pred[succesor[x][i]])
                q.push(succesor[x][i]);
        }
        sol[++k]=x;
        q.pop();
    }
    for(i=1;i<=k;i++)
        printf("%d ",sol[i]);
    return 0;
}