#include <cstdio>
# include <vector>
using namespace std;

vector <int> v[50010];
int nod,i,nr,p,q[500010],x,y,n,m;
bool use[50010];
void dfs(int nod)
{
    int i;
    use[nod]=true;
    nr++;
    for (i=0; i<v[nod].size(); i++)
        if (use[v[nod][i]]==false)
        {
            dfs(v[nod][i]);
            nr++;
            q[++p]=v[nod][i];
        }
}
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d %d\n",&n,&m);
    for (i=1; i<=m; i++)
    {
        scanf("%d %d\n",&x,&y);
        v[x].push_back(y);
    }

    nr=0;
    for (i=1; i<=n; i++)
        if(use[i]==false)
        {
            dfs(i);
            q[++p]=i;

        }
    for (i=p; i>=1; i--)
        printf("%d ",q[i]);
    printf("\n");
    return 0;
}