#include <fstream>
#include <vector>
#include <algorithm>
#define mmax 100005
#define nmax 50005
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
vector < int > E[mmax];
vector < int > List;
bool visited[nmax];
int n, m;
void Dfs(int node)
{
    visited[node] = true;
    for (auto it : E[node])
        if (!visited[it]) Dfs(it);
    List.push_back(node);
}
int main()
{
    cin >> n >> m;
    while (m--)
    {
        int x, y;
        cin >> x >> y;
        E[x].push_back(y);
    }
    for (int i = 1; i <= n; i++)
        if (!visited[i]) Dfs(i);
    reverse(List.begin(), List.end());
    for (auto it : List) cout << it << " ";
    return 0;
}