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

using namespace std;

pair<int,int>ord[50002];
vector<int>g[50002];
bool used[50002];
int i,n,m,x,y,lg;

void dfs(int nod)
{
    used[nod]=true;
    ++lg;
    for(int i=0;i<g[nod].size();i++)
    {
        if(!used[g[nod][i]])
        {
            dfs(g[nod][i]);
        }
    }
    ord[nod].first=++lg;
    ord[nod].second=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);
        g[x].push_back(y);
    }
    for(i=1;i<=n;i++)
    {
        if(!used[i])
        {
            dfs(i);
        }
    }
    sort(ord+1,ord+n+1);
    for(i=n;i>=1;i--)
    {
        printf("%d ",ord[i].second);
    }
    return 0;
}