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

using namespace std;

ifstream f ("sortaret.in");
ofstream g ("sortaret.out");

const int SIZE = 50005;

int n, m;
int inDeg[SIZE];

vector <int> adj[SIZE];

void Read()
{
    f >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int x, y;
        f >> x >> y;
        adj[x].push_back(y);
        inDeg[y]++;
    }
}

void Solve()
{
    queue <int> q;
    for (int i = 1; i <= n; i++)
    {
        if (inDeg[i] == 0)
        {
            q.push(i);
        }
    }

    while (q.empty() == false)
    {
        int node = q.front();
        q.pop();
        g << node << " ";

        for (unsigned int i = 0; i < adj[node].size(); i++)
        {
            int neighbour = adj[node][i];
            inDeg[neighbour]--;

            if (inDeg[neighbour] == 0)
            {
                q.push(neighbour);
            }
        }
    }
}

int main()
{
    Read();
    Solve();

    return 0;
}