#include <iostream>
#include <vector>
#include <queue>
#include <fstream>

using namespace std;

const int MAX_N = 50001;

vector<int> graf[MAX_N];
int grade_intrare[MAX_N];

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

void sortareTopologica(int N) {
    queue<int> coada;
    vector<int> rezultat;
    for (int i = 1; i <= N; ++i) {
        if (grade_intrare[i] == 0) {
            coada.push(i);
        }
    }
    while (!coada.empty()) {
        int nod = coada.front();
        coada.pop();
        rezultat.push_back(nod);

        for (int vecin : graf[nod]) {
            grade_intrare[vecin]--;
            if (grade_intrare[vecin] == 0) {
                coada.push(vecin);
            }
        }
    }
    for (int i = 0; i < N; ++i) {
        fout<< rezultat[i] << " ";
    }
}

int main() {
    int N, M;
    fin>> N >> M;
    for (int i = 0; i < M; ++i) {
        int x, y;
        fin>> x >> y;
        graf[x].push_back(y);
        grade_intrare[y]++;
    }
    sortareTopologica(N);
    return 0;
}