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

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

int n, m, v[50002],sefi[50002];
vector <int> a[50002];
queue <int> coada;
bool marcat [50002];

void citire () {
    int x, y;
    in >> n >> m;
    while (m--) {
        in >> x >> y;
        a[x].push_back(y);
        ++sefi[y];
    }
}

void bfs () {
    int x, y;
    while (!coada.empty()) {
        x = coada.front();
        coada.pop();
        out << x << ' ';
        for (size_t i = 0; i < a[x].size (); ++i) {
            y = a[x][i];
            --sefi[y];
            if(sefi[y] == 0) coada.push (y);
        }

    }
}

int main () {

    //cout << "schimba";

    citire ();

    for (int i = 1; i <= n; ++i) {
        if (!sefi[i]) {
            coada.push(i);
        }
    }

    bfs ();

    return 0;
}