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

using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int grad[50002];
vector <int> graph[50002];
priority_queue <int> v;

void sortt()
{
    int nod;
    while (!v.empty())
    {
        nod = -v.top();
        v.pop();
        g << nod << ' ';
        for (int i = 0;i < graph[nod].size();++i)
        {
            int vee = graph[nod][i];
            --grad[vee];
            if (grad[vee] == 0)
                v.push(-vee);
        }
    }
}

int main()
{
    int m, n;
    f >> n >> m;
    int x, y;
    for (int i = 1;i <= m;++i)
    {
        f >> x >> y;
        graph[x].push_back(y);
        grad[y]++;
    }
    for (int i = 1;i <= n;++i)
        if (grad[i] == 0)
            v.push(-i);
    sortt();
    return 0;
}