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

using namespace std;

struct Nod
{
    int grad_interior;
    vector<int> vecini;
};

typedef vector<Nod> Graf;

vector<int> Sorteaza(Graf &g)
{
    vector<int> ordine;
    queue<int> coada;
    for (unsigned i = 1; i < g.size(); ++i)
        if (g[i].grad_interior == 0)
            coada.push(i);

    while (!coada.empty()) {
        int nod = coada.front();
        ordine.push_back(nod);
        coada.pop();

        for (int vecin : g[nod].vecini) {
            --g[vecin].grad_interior;
            if (g[vecin].grad_interior == 0)
                coada.push(vecin);
        }
    }
    return ordine;
}

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

    int n, m;
    fin >> n >> m;

    Graf graf(n + 1);
    while (m--) {
        int x, y;
        fin >> x >> y;
        graf[x].vecini.push_back(y);
        ++graf[y].grad_interior;
    }

    auto ordine = Sorteaza(graf);
    for (int i : ordine)
        fout << i << " ";

    return 0;
}