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

using namespace std;

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

const int MAX_N = 50001;

vector<int> G[MAX_N];
queue<int> coada;
vector<int> grad(MAX_N, 0);
int N,M;
void sortareTopologica()
{
    for (int i = 1; i <= N; i++)
    {
        if (grad[i] == 0)
        {
            coada.push(i);
        }
    }
    while (!coada.empty())
    {
        int nod = coada.front();
        coada.pop();
        fout << nod <<" ";

        for (int vecin : G[nod])
        {
            grad[vecin]--;
            if (grad[vecin] == 0)
            {
                coada.push(vecin);
            }
        }
    }
}

int main()
{
    fin >> N >> M;
    int X, Y;
    for (int i = 0; i < M; i++)
    {
        fin >> X >> Y;
        G[X].push_back(Y);
        grad[Y]++;
    }
    sortareTopologica();

    return 0;
}