#include <iostream>
#include <cstdio>
#include <queue>
#include <vector>
#define Nmax 50000+5
using namespace std;

int n,m;
vector<int> L[Nmax];
queue<int> Q;
int d[Nmax];

void citire()
{
    scanf("%d%d",&n,&m);
    for (int i=1; i<=m; i++)
    {
        int x,y;
        scanf("%d %d",&x,&y);
        d[y]++;
        L[x].push_back(y);
    }
}

void rezolvare()
{
    while (!Q.empty())
    {
        int x=Q.front();
        Q.pop();
        for (int i=0; i<L[x].size(); i++)
        {
            int y=L[x][i];
            d[y]--;
            if (d[y]==0)
            {
                Q.push(y);
                printf("%d ",y);
            }
        }

    }

}

void afisare()
{
    while (!Q.empty())
    {
        int x;
        x=Q.front();
        printf("%d ",x);
        Q.pop();
    }
}

int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    citire();
    for (int i=1; i<=n; i++)
        if (d[i]==0)
        {
            Q.push(i);
            printf("%d ",i);
        }
    rezolvare();
    afisare();
    return 0;
}