#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;

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

vector <int> G[50005];

int n, m, x, y, i, pred[100005], rez[100005], poz;

int main()
{
    fin >> n >> m;
    for (i = 1; i <= m; i++)
    {
        fin >> x >> y;
        G[x].push_back(y);
        pred[y]++;
    }
    int ok = 1;
    while (ok == 1)
    {
        ok = 0;
        for (i = 1; i <= n; i++)
        {
            if (pred[i] == 0)
            {
                ok = 1;
                pred[i] = -1;
                poz++;
                rez[poz] = i;
                for (unsigned int j = 0; j < G[i].size(); j++)
                {
                    pred[G[i][j]]--;
                }
            }
        }
    }
    for (i = 1; i <= poz; i++)
    {
        fout << rez[i] << " ";
    }
    return 0;
}