#include <bits/stdc++.h>
std::ifstream fin("sortaret.in");
std::ofstream fout("sortaret.out");

int n, m;
std::vector<int> nb[50001];
std::vector<int> inDegr(50001, 0);

void TopologicalSort()
{
    int i, node;
    std::vector<int> q;
    for(i = 1; i <= n; i++)
        if(inDegr[i] == 0)
            q.push_back(i);

    i = 0;
    while(i < q.size()){
        node = q[i];
        for(auto j: nb[node])
        {
            inDegr[j]--;
            if(inDegr[j] == 0)
                q.push_back(j);
        }
        i++;
    }

    for(i = 0; i < n; i++)
        fout<< q[i] << " ";

}


int main()
{
    int i, x, y;
    fin >> n >> m;
    for(i = 0; i < m; i++)
    {
        fin >> x >> y;
        nb[x].push_back(y);
        inDegr[y]++;
    }
    TopologicalSort();
    return 0;
}