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