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

using namespace std;

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

const int NMAX = 50000 + 1;

int n, m;
int grad[NMAX];
queue <int> Q;
vector <int> graf[NMAX];

void citeste() {
    f >> n >> m;
    int a, b;
    for (int i = 1; i <= m; i++) {
        f >> a >> b;
        graf[a].push_back(b);
        grad[b]++;
    }
}

void reset(int nod) {
    int fiu, l = graf[nod].size();
    for (int i = 0; i < l; i++) {
        fiu = graf[nod][i];
        grad[fiu]--;
        if (grad[fiu] == 0) Q.push(fiu);
    }
}

void rezolva() {
    int nod;

    for (int i = 1; i <= n; i++)
        if (grad[i] == 0) Q.push(i);

    while (!Q.empty()) {
        nod = Q.front();
        Q.pop();
        g << nod << ' ';
        reset(nod);
    }
}

int main() {
    citeste();
    rezolva();
}