#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
vector <vector <int> > much;
int n,m;
int gre[50001];
queue<int> q;
void citire()
{
    freopen("sortaret.in","r",stdin);
    scanf("%d%d",&n,&m);
    int a,b;
    much.resize(n+1);
    for(int i=1;i<=m;++i)
    {
        scanf("%d%d",&a,&b);
        much[a].push_back(b);
        gre[b]++;
    }
    fclose(stdin);
}
void solve()
{
    freopen("sortaret.out","w",stdout);
    for(int i=1;i<=n;++i)
        if(gre[i]==0)
            q.push(i);
    while(q.size()!=0)
    {
        for(int j=0;j<much[q.front()].size();++j){
            gre[much[q.front()][j]]--;
            if(gre[much[q.front()][j]]==0)
                q.push(much[q.front()][j]);
        }
        printf("%d ",q.front());
        q.pop();
    }
    printf("\n");
    fclose(stdout);
}
int main()
{
    citire();
    solve();
    return 0;
}