#include <fstream>
#include <vector>
#define DEF 50001

using namespace std;

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

vector <int> N[DEF], sol;

int n, m;
bool viz[DEF];

void dfs (int nod) {
    viz [nod] = 1;
    for (int i = 0; i < N[nod].size (); i++) {
        if (viz [N[nod][i]] == 0)
            dfs (N[nod][i]);
    }
    sol.push_back (nod);
}

int main () {
    fin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int x, y, ok = 1;
        fin >> x >> y;
        for (int j = 0; j < N[x].size (); j++) {
            if (N[x][j] == y)
                ok = 0;
        }
        if (ok)
            N[x].push_back (y);
    }

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

    for (int i = sol.size () - 1; i >= 0; i--)
        fout << sol[i] << " ";

    return 0;
}