#include <cstdio>
#include <queue>
#include <vector>
using namespace std;

vector <int> succ[50005];
queue <int> q;
int pred[50005];

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

    int n, k, a, b, urm, aux;
    scanf("%d %d", &n, &k);

    for (register int i = 1; i <= k; ++i)
    {
        scanf("%d %d", &a, &b);
        succ[a].push_back(b);
        ++pred[b];
    }

    for (register int i = 1; i <= n; ++i)
        if (pred[i] == 0)
            q.push(i);

    while (!q.empty())
    {
        aux = q.front();
        printf("%d ", aux);
        for (register int i = 0; i < succ[aux].size(); ++i)
        {
            urm = succ[aux][i];
            --pred[urm];
            if (pred[urm] == 0)
                q.push(urm);
        }
        q.pop();
    }
    return 0;
}