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

using namespace std;

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

const int NMAX = 5e5 + 1;

vector<int> g[NMAX];
bitset<NMAX> viz;
stack<int> st;

void DFS(int x)
{
    viz[x] = 1;
    for (auto &y : g[x])
        if (viz[y] == 0)
            DFS(y);
    st.push(x);
}
int main()
{
    int n, m;
    fin >> n >> m;
    int x, y;
    for (int i = 0; i < m; ++i)
    {
        fin >> x >> y;
        g[x].push_back(y);
    }
    for (int i = 1; i <= n; ++i)
        if (!viz[i])
            DFS(i);
    while (!st.empty())
    {
        fout << st.top() << " ";
        st.pop();
    }
    return 0;
}