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

using namespace std;

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

int n, m, f[100005];
vector < int > v[100005];
stack < int > st;

void citire()
{
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        fin >> x >> y;
        v[x].push_back(y);
    }
}

void dfs(int k)
{
    f[k] = 1;
    for(unsigned int i = 0; i < v[k].size(); i++)
        if(f[v[k][i]] == 0)
            dfs(v[k][i]);
    st.push(k);
}



void afisare()
{
    while(!st.empty())
    {
        fout << st.top() << ' ';
        st.pop();
    }
}

int main()
{
    citire();
    for(int i = 1; i <= n; i++)
        if(f[i] == 0)
            dfs(i);
    afisare();

}