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