#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
int n,m,dg[50005];
vector <int> G[50005];
#define pb push_back
void topsort()
{
    int Q[50005];
    Q[0]=0;
    for (int i=1;i<=n;i++)
        if (dg[i]==0) Q[++Q[0]]=i;
    for (int i=1;i<=Q[0];i++)
    {
        int nod=Q[i];
        for (vector<int>::iterator it=G[nod].begin();it!=G[nod].end();it++)
        {
            dg[*it]--;
            if (dg[*it]==0) Q[++Q[0]]=*it;
        }
    }
    for (int i=1;i<=n;i++)
        printf("%d ",Q[i]);
}
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d %d",&n,&m);
    int x,y;
    while (m--)
    {
        scanf("%d %d",&x,&y);
        G[x].pb(y);
        dg[y]++;
    }
    topsort();
    return 0;
}