#include <bits/stdc++.h>

using namespace std;

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

int main()
{
    int n, m;
    fin >> n >> m;

    vector<vector<int>> v(n + 1);
    vector<bool> ok(n + 1);
    vector<int> grad(n + 1);


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

        v[x].push_back(y);
        grad[y]++;
    }

    queue<int> q;
    for(int i = 1; i <= n; i++)
    {
        if(grad[i] == 0)
        {
            q.push(i);
            ok[i] = true;
        }
    }

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

        fout << nod << " ";

        for(auto i : v[nod])
        {
            grad[i]--;

            if(grad[i] == 0 && !ok[i])
            {
                ok[i] = true;
                q.push(i);
            }
        }
    }


    return 0;
}