#include <bits/stdc++.h>
using namespace std;
ifstream fin ("sortaret.in");
ofstream fout("sortaret.out");
const int dim = 50002;
int n,m,sol[dim],grad[dim],nr;
vector<int>a[dim];
bool viz[dim];

void sortare ()
{
    queue<int>coada;
    for (int i=1;i<=n;i++)
        for (int y:a[i])
        grad[y]++;
    for (int i=1;i<=n;i++)
        if (grad[i]==0)
            coada.push(i);
    nr=0;
    while (!coada.empty())
    {
        int x=coada.front();
        coada.pop();
        sol[x]=++nr;
        for (int y:a[x])
        {
            grad[y]--;
            if (grad[y]==0)
                coada.push(y);
        }
    }
}

int main()
{
    fin>>n>>m;
    int x,y,i ;
    for (i=1;i<=m;i++)
    {
        fin>>x>>y;
        a[x].push_back(y);
    }
    sortare();
    for (i=1;i<=n;i++)
        fout<<sol[i]<<' ';
    return 0;
}