#include<cstdio>
#include<vector>
#include<algorithm>

using namespace std;

vector<int> a[100004];
int n,m,i,nr,x,y,lg,st[100004],pos[100004],Ti[100004],Tf[100004];
bool sel[100004];

bool cmp(int x,int y)
{
    return Tf[y]<Tf[x];
}

void dfs(int nod)
{
    sel[nod]=true;
    Ti[nod]=++lg;
    for(int i=0;i<a[nod].size();i++)
    {
        if(!sel[a[nod][i]])
        {
            dfs(a[nod][i]);
        }
    }
    Tf[nod]=++lg;
    pos[nod]=nod;
}

int main()
{
    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);
        a[x].push_back(y);
    }
    for(i=1;i<=n;i++)
    {
        if(!sel[i])
        {
            dfs(i);
        }
    }
    sort(pos+1,pos+n+1,cmp);
    for(i=1;i<=n;i++)
    {
        printf("%d ",pos[i]);
    }
    return 0;
}