#include <stdio.h>
#include <vector>
using namespace std;
vector <int> v[50001];
int coada[50001],j,n,x,y,i;
bool viz[50001];
void dfs(int nod)
{
    int m;
    viz[nod]=1;
    while(!v[nod].empty())
    {
        m=v[nod].back();
        v[nod].pop_back();
        if(viz[m]==0)
        dfs(m);

    }
    coada[++j]=nod;
}
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    int m;
    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=n;i>=1;i--)
        printf("%d ",coada[i]);
    return 0;
}