#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

vector <int> A[100001];
queue <int> coada;
int v[100001];

void dfs(int nod) {
    v[nod] = -1;
    for (int i = 0; i < A[nod].size(); ++i) {
        if (v[i]) {
            v[i] = -1;
            dfs(i);
        }
    }
    coada.push(nod);
}

int main() {
    int n, m, x, y;
    fin >> n >> m;
    for (int i = 1; i <= m; ++i) {
        fin >> x >> y;
        A[x].push_back(y);
    }
    for (int i = 1; i <= n; ++i)
        if (v[i])
            dfs(i);

    while (!coada.empty) {
        fout << coada.front() << " ";
        coada.pop();
    }

}