#include <fstream>
#include <vector>
#include <stack>

using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

bool viz[50005];
int n, m, x, y, i;
stack <int> ordine;
vector<int> ls[50005];

void df(int x) {
    int i, l = ls[x].size(), y;
    viz[x] = 1;
    for (i = 0; i < l; i++) {
        y = ls[x][i];
        if (viz[y] == 0)
            df(y);
    }
    ordine.push(x);
}

int main() {
    f >> n >> m;
    for (i = 1; i <= m; i++) {
        f >> x >> y;
        ls[x].push_back(y);
    }
    for (i = 1; i <= n; i++)
        if (viz[i] == 0)
            df(i);
    while (ordine.empty() == 0) {
        g << ordine.top()<< ' ';
        ordine.pop();
    }
}