#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
vector<int>v[50001];
int sol[50001];
int viz[50001];
int n,m,i,k;
int cmp(int x,int y)
{
    if (x<y) return 0;
    return 1;
}
void DF(int nod)
{
    vector<int>::iterator it;
    viz[nod]=1;
    for (it=v[nod].begin();it!=v[nod].end();++it)
    {
        if (viz[*it]==0)
        {
            DF(*it);
        }
    }
    sol[++k]=nod;
}
int main()
{
    int x,y;
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d%d",&n,&m);
    for (i=1;i<=m;++i)
    {
        scanf("%d%d",&x,&y);
        v[x].push_back(y);
    }
    for (i=1;i<=n;++i)
    {
        sort(v[i].begin(),v[i].end(),cmp);
    }
    for (i=1;i<=n;++i)
    {
        if (viz[i]==0)
        {
            DF(i);
        }
    }
   for (i=k;i>=1;--i)
        printf("%d ",sol[i]);
    return 0;
}