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

using namespace std;

const int N = 5e4;

vector <int> s[N+1];
int nrp[N+1];

int main()
{
    ifstream in("sortaret.in");
    ofstream out("sortaret.out");
    int n, m;
    in >> n >> m;
    for (int i = 0; i < m; i++)
    {
        int x, y;
        in >> x >> y;
        s[x].push_back(y);
        nrp[y]++;
    }
    ///adaugam in q varfurile fara predecesori
    queue <int> q;
    for (int i = 1; i <= n; i++)
    {
        if (nrp[i] == 0)
        {
            q.push(i);
        }
    }
    ///adaugam in ordinea potrivita si celelalte varfuri
    while (!q.empty())
    {
        int x = q.front();
        q.pop();
        out << x << " ";
        for (auto y: s[x])///pentru fiecare succesor y al lui x
        {
            nrp[y]--;
            if (nrp[y] == 0)
            {
                q.push(y);
            }
        }
    }
    in.close();
    out.close();
    return 0;
}