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

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

int predCount[50001];
int topOrd[50001];
vector<int> vecini[50001];
queue<int> qu;

int main()
{
    int N, M, x, y, top = 0;
    in >> N >> M;
    for (int i = 0; i < M; i++)
    {
        in >> x >> y;
        predCount[y]++;
        vecini[x].push_back(y);
    }
    for (int i = 1; i <= N; i++)
        if (predCount[i] == 0) qu.push(i);

    while (!qu.empty())
    {
        int head = qu.front(); qu.pop();
        topOrd[top++] = head;
        for (int i = 0; i < vecini[head].size(); i++)
        {
            predCount[vecini[head][i]] -= 1;
            if (predCount[vecini[head][i]] == 0) qu.push(vecini[head][i]);
        }
    }

    for (int i = 0; i < top; i++)
        out << topOrd[i] << ' ';
    return 0;
}