#include<cstdio>
#include<vector>
using namespace std;
int n,m,k,x,y,a[100004],viz[100004];
vector < int > v[100004];
void dfs(int nod)
{
    viz[nod]=1;
    for(int i=0;i<v[nod].size();i++)
        if(viz[v[nod][i]]==0)
            dfs(v[nod][i]);
    a[k--]=nod;
}
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d %d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d %d",&x,&y);
        v[x].push_back(y);
    }
    k=n;
    for(int i=1;i<=n;i++)
        if(viz[i]==0)dfs(i);
    for(int i=1;i<=n;i++)
            printf("%d ",a[i]);
    return 0;
}