#include <fstream>
#include <vector>
using namespace std;
int n, m, i, j, x, y, f[50001], crt;
bool exp[50001];
vector <int>  g[50001];
ifstream fin ("sortaret.in");
ofstream fout ("sortaret.out");

void dfs (int s)
{
    int i=0;
    exp[s]=1;
    for (i=0;i<g[s].size();i++) {
        int nod = g[s][i];
        if (!exp[nod])
            dfs(nod);
    }
    f[s]=crt;
    crt--;
}

int main () {
    fin>>n>>m;
    for (i=1;i<=m;i++) {
        fin>>x>>y;
        g[x].push_back(y);
    }
    crt=n;
    for (i=1;i<=n;i++) {
        if (!exp[i])
            dfs(i);
    }
    for (i=1;i<=n;i++)
        fout<<f[i]<<" ";
    return 0;
}