#include <bits/stdc++.h>
#define nmax 50002
using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int n, m;
int viz[nmax];
set<int> Graph[nmax];
list<int> ts;

void dfs(int node)
{
    viz[node] = 1;
    ts.push_back(node);
    for (auto i : Graph[node])
    {
        if (!viz[i])
        {
            dfs(i);
        }
    }
}

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int x, y;
        fin >> x >> y;
        Graph[x].insert(y);
    }
    for (int i = 1; i <= n; i++)
    {
        if (!viz[i])
            dfs(i);
    }
    for (auto i : ts)
    {
        fout << i << " ";
    }
    return 0;
}