#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
vector <int> G[50005];
vector <int> ::iterator it;
int vGrade[50005];
queue <int> deBFS;
int n,m;
void citire()
{
    int aux1,aux2;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d",&aux1,&aux2);
        G[aux1].push_back(aux2);
        vGrade[aux2]++;
    }
    for(int i=1;i<=n;i++)
    {
        if(vGrade[i]==0)
            {
                deBFS.push(i);
                printf("%d ",i);
            }
    }

}
void sortTop()
{
    int nod;
    while(!deBFS.empty())
    {
        nod=deBFS.front();
        deBFS.pop();
        for(it=G[nod].begin();it!=G[nod].end();it++)
        {
            vGrade[*it]--;
            if(vGrade[*it]==0)
                {
                    deBFS.push(*it);
                    printf("%d ",*it);
                }
        }
    }
}
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    citire();
    sortTop();
    return 0;
}