#include <iostream>
#include <fstream>
#include <vector>
#include <stack>

using namespace std;

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

const int SIZE = 50005;

int n, m;

vector <int> adj[SIZE];
vector <int> visited(SIZE, false);

stack <int> s;

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

void DFS(int node)
{
    visited[node] = true;
    for (unsigned int i = 0; i < adj[node].size(); i++)
    {
        int neighbour = adj[node][i];
        if (visited[neighbour] == false)
        {
            DFS(neighbour);
        }
    }
    s.push(node);
}

void Print()
{
    while (s.empty() == false)
    {
        g << s.top() << " ";
        s.pop();
    }
}

int main()
{
    Read();

    for (int i = 1; i <= n; i++)
    {
        if (visited[i] == false)
        {
            DFS(i);
        }
    }

    Print();

    return 0;
}