#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector<vector<int> > gr;
vector<bool> aj;
vector<int> li;
int N, M;
void read() {
    int x, y;
    fin >> N >> M;
    gr.resize(N + 1);
    aj.resize(N + 1, 0);
    for (int i = 0; i < M; ++i) {
        fin >> x >> y;
        gr[y].push_back(x);
    }
}
void DFS(int node) {
    aj[node] = 1;
    for (auto i : gr[node]) {
        if (!aj[i]) {
            DFS(i);
        }
    }
    li.push_back(node);
}
int main()
{
    read();
    for (int i = N; i > 0; --i) {
        if (!aj[i]) {
            DFS(i);
        }
    }
    for (int i = 0; i < li.size(); ++i) {
        fout << li[i] << " ";
    }
    return 0;
}