#include <stdio.h>
#include <set>

using namespace std;

int n, m, viz[50010], sol[50010], k, fol[50010];
set<int> l[100010];
FILE*f=fopen("sortaret.in","r"),*g=fopen("sortaret.out","w");


void DFS(int nod)
{
    viz[nod] = 1;
    for(set<int>::iterator it = l[nod].begin(); it !=  l[nod].end();it++)
    {
        if(viz[*it] == 0)
        {
            DFS(*it);
        }
    }
    sol[++k] = nod;
}

void afisare()
{
    for(int i = n;i >= 1; i--)
    {
        fprintf(g,"%d ",sol[i]);
    }
}

int main()
{
    int x, y;
    fscanf(f,"%d %d\n",&n,&m);
    for(int i = 1; i <= m; i++)
    {
        fscanf(f,"%d %d\n",&x,&y);
        l[x].insert(y);
    }
    for(int i = 1; i <= n; i++)
    {
        if(viz[i] == 0 && l[i].size() != 0)
        {
             DFS(i);
        }
    }
    afisare();
    return 0;
}