#include <fstream>
#include <vector>
#include <stack>
#include <bitset>
#include <algorithm>

using namespace std;

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

#define MAXN 50005

int n, m, grad[MAXN];
vector<int> G[MAXN];
stack<int> rez;
bitset<MAXN> viz;

void citire() {
    f >> n >> m;
    int nod1, nod2;
    for (int i = 0; i < m; ++i) {
        f >> nod1 >> nod2;
        /*if(find(G[nod1].begin(),G[nod1].end(),nod2)==G[nod1].end()) {*/
        grad[nod2]++;
        G[nod1].push_back(nod2);
        /*}*/
    }
}

void DFS(int nod) {
    for (auto &nod2:G[nod])
        if (!viz[nod2]) {
            viz[nod2] = true;
            DFS(nod2);
        }
    rez.push(nod);
}

void parcurgere() {
    for (int i = 1; i <= n; ++i)
        if (!viz[i]) {
            viz[i] = true;
            DFS(i);
        }
}

void afisare() {
    while (!rez.empty()) {
        g << rez.top() << ' ';
        rez.pop();
    }
}

int main() {
    citire();
    parcurgere();
    afisare();
    return 0;
}