#include <cstdio>
#include <vector>
#define nmax 50005
#define pb push_back

using namespace std;

vector <int> a[nmax];
int n, m, x, y, Q[nmax], deg[nmax], i;

void sortaretop()
{
    int i, j, k=0;
    vector <int>::iterator it;

    for(i=1; i<=n; ++i)
    if(deg[i]==0) Q[++Q[0]]=i;

    for(i=1; i<=n; ++i)
    {
        k=Q[i];
        for(it=a[k].begin(); it!=a[k].end(); ++it)
        {
            --deg[*it];
            if(deg[*it]==0) Q[++Q[0]]=*it;
        }
    }
}

int main ()
{
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);

    scanf("%d%d", &n, &m);

    for(i=1; i<=m; ++i)
    {
        scanf("%d%d", &x, &y);
        a[x].pb(y);
        ++deg[y];
    }

    sortaretop();

    for(i=1; i<=n; ++i) printf("%d ", Q[i]);

    return 0;
}