#include <bits/stdc++.h>
#define pb push_back
#define MAX 50005

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

vector < int > v[MAX], R;
bool viz[MAX];

void dfs(int nod);

int main()
{
    int n, m, i, x, y;

    fin >> n >> m;
    for(i = 1; i <= m; i++)
    {
        fin >> x >> y;
        v[x].pb(y);
    }

    for(i = 1; i <= n; i++) if(viz[i] == 0) dfs(i);

    reverse(R.begin(), R.end());
    for(int nod:R) fout << nod << ' ';

    return 0;
}

void dfs(int nod)
{
    viz[nod] = 1;
    for(int vecin:v[nod]) if(viz[vecin] == 0) dfs(vecin);
    R.pb(nod);
}