#include <bits/stdc++.h>

using namespace std;

const int Nmax = 50001;

vector <int> v[Nmax];
queue <int> Q;

int i, n, m, x, y, g[Nmax], nr;

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);
        v[x].push_back(y);
        g[y]++;
    }
    while (nr<n)
    {
        for (i=1; i<=n; i++)
        {
            if (g[i]==0)
            {
                nr++;
                Q.push(i);
                g[i]=-1;
                for (vector <int> ::iterator it=v[i].begin(); it!=v[i].end(); ++it)
                {
                    --g[*it];
                }
            }
        }
    }
    while (!Q.empty())
    {
        printf ("%d ", Q.front()); Q.pop();
    }
}