#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

#define NMAX 50005

vector<int> G[NMAX];
bool viz[NMAX];
int ord[NMAX];
int k;

void dfs(int nod) {
    viz[nod] = 1;

    for (auto it : G[nod]) {
        if (!viz[it]) {
            dfs(it);
        }
    }

    ord[++k] = nod;
}

int main() {
    int n, m;
    fin >> n >> m;
    while (m--) {
        int x, y;
        fin >> x >> y;
        G[x].push_back(y);
    }

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

    for (int i = n; i >= 1; --i) {
        fout << ord[i] << ' ';
    }
    return 0;
}