#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
using namespace std;

int n, m;
vector<vector<int>> graf;
vector<int> visited;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
stack<int> s;
void dfs(int node)
{
    visited[node] = 1;
    for (int i = 0; i < graf[node].size(); i++)
    {
        int neighbour = graf[node][i];
        if (!visited[neighbour])
            dfs(neighbour);
    }
    s.push(node);

}
int main()
{
    in >> n >> m;
    graf.resize(n+1);
    vector<int> deg(n+1, 0);
    visited.resize(n+1, 0);
    for (int i = 0; i < m; i++)
    {
        int x,y;
        in >> x >> y;
        graf[x].push_back(y);
        deg[y]++;
    }
    for (int i = 1; i <= n; i++)
        if (deg[i] == 0)
            dfs(i);

    while (!s.empty())
    {
        out << s.top() << " ";
        s.pop();
    }

}