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

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

int n, m;
int viz[100005];
vector<int> L[100005];
stack<int> st;

void DFS(int k)
{
    viz[k] = 1;
    for (int i : L[k])
        if (viz[i] == 0)
            DFS(i);
    st.push(k);
}

int main()
{
    int i, j;
    fin >> n >> m;
    while (m--)
    {
        fin >> i >> j;
        L[i].push_back(j);
    }
    for (i = 1; i <= n; i++)
        if (viz[i] == 0)
            DFS(i);
    while (!st.empty())
    {
        fout << st.top() << " ";
        st.pop();
    }
    return 0;
}