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

using namespace std;

vector<int> a[50001];
int x,y,i,n,m,pos[50001],tf[50001],lg;
bool sel[50001];

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

bool cmp(int x,int y)
{
    return tf[x]>tf[y];
}

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;
}