#include <iostream>
#include <cstdio>
#include <stack>
using namespace std;

stack < int > S;
int n,m,viz[50001];
struct nod{
    int inf;
    nod *urm;
};
nod *g[50001];

void add(int x,int y)
{
    nod *aux=new nod;
    aux->inf=y;
    aux->urm=g[x];
    g[x]=aux;
}

void citire()
{
    freopen("sortaret.in","r",stdin);
    scanf("%d%d",&n,&m);
    int x,y;
    for (int i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        add(x,y);
    }
}

void dfs(int x)
{
    for (nod *p=g[x];p;p=p->urm)
        if (!viz[p->inf])
        {
            viz[p->inf]=1;
            dfs(p->inf);
            S.push(p->inf);
        }
}

void solve()
{
    for (int i=1;i<=n;i++)
        if (!viz[i])
        {
            viz[i]=1;
            dfs(i);
            S.push(i);
        }
    freopen("sortaret.out","w",stdout);
    while (!S.empty())
    {
        printf("%d ",S.top());
        S.pop();
    }
}

int main()
{
    citire();
    solve();
    return 0;
}