#include <cstdio>
#include <vector>
#include <queue>

using namespace std;

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

    int n, m, x, y, i, no = 0;
    scanf("%d%d", &n, &m);
    vector<vector<int>> arcs(n+1);
    vector<int> degs(n+1, 0);
    vector<int> ord(n+1, 0);

    for (i=1; i<=m; ++i)
    {
        scanf("%d%d", &x, &y);
        arcs[x].push_back(y);
        degs[y] ++;
    }

    queue<int> q;

    for(i=1; i<=n; ++i)
        if(degs[i] == 0)
        {
            ++no;
            ord[i] = no;
            q.push(i);
        }

    while (!q.empty())
    {
        x = q.front();
        q.pop();

        for(i=0; i<arcs[x].size(); ++i)
        {
            --degs[arcs[x][i]];
            if(degs[arcs[x][i]] == 0)
            {
                ++no;
                ord[arcs[x][i]] = no;
                q.push(arcs[x][i]);
            }
        }
    }

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

    fclose(stdin);
    fclose(stdout);
    return 0;
}