#include <fstream>

using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
const int MAXN = 50001, MAXM = 100001;

int lst[MAXN], vf[MAXM], urm[MAXM], pred[MAXN], d[MAXN], q[MAXN];
int n, m, nr;
void adauga(int, int);
void bfsTop();
int main()
{
    cin >> n >> m;
    for(int i = 1; i <= m; ++i)
    {
        int x, y;
        cin >> x >> y;
        adauga(x, y);
        pred[y]++;
    }
    bfsTop();
    return 0;
}

void adauga(int x, int y)
{
    ++nr;
    vf[nr] = y;
    urm[nr] = lst[x];
    lst[x] = nr;
}

void bfsTop()
{
    for(int i = 1; i <= n; ++i)
        d[i] = -1;
    int st = 0, dr = -1;
    for(int i = 1; i <= n; ++i)
    {
        if(pred[i] == 0)
        {
            q[++dr] = i;
            d[i] = 0;
        }
    }
    while(st <= dr)
    {
        int x = q[st++];
        cout << x << ' ';
        for(int p = lst[x]; p; p = urm[p])
        {
            int y = vf[p];
            pred[y]--;
            if(d[y] == -1 && pred[y] <= 0)
            {
                q[++dr] = y;
                d[y] = 1 + d[x];
            }
        }
    }
}