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

using namespace std;

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

const int DMAX = 50005;

unsigned int n, m;
vector <unsigned int> G[DMAX], gradInt;

queue <unsigned int> coada;

void read()
{
    f >> n >> m;

    gradInt = vector <unsigned int> (n + 1, 0);

    for (unsigned int i = 1; i <= m; i++)
    {
        unsigned int x, y;

        f >> x >> y;

        gradInt[y]++;

        G[x].push_back(y);
    }
}

void bfs()
{
    for (unsigned int i = 1; i <= n; i++)
    {
        if (gradInt[i] == 0)
            coada.push(i);
    }

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

        g << nod << ' ';

        for (auto vecin : G[nod])
        {
            gradInt[vecin]--;

            if (gradInt[vecin] == 0)
            {
                coada.push(vecin);
            }
        }
    }
}

int main()
{
    read();
    bfs();

    return 0;
}