#include <cstdio>
#include <vector>

using namespace std;
vector <int> v[50005];
int n,m,i,x,y,k,st[50005];
bool viz[50005];

void dfs(int x)
{
    viz[x]=1;
    for (int i=0; i<v[x].size(); i++)
        if (viz[v[x][i]]==0)
        dfs(v[x][i]);
    st[++k]=x;
}

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);
        v[x].push_back(y);
    }
    for (i=1; i<=n; i++)
        if (viz[i]==0)
        dfs(i);
    for (i=k; i>=1; i--)
        printf("%d ",st[i]);
    return 0;
}