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

using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
const int NMAX = 50000;
vector <int>g[NMAX+5];
stack <int> st;
bool viz[NMAX+5];
///Sortare topologica cu ajutorul unui dfs.Cand nodul nu mai are vecini, il adaugam intr-o stiva;
///Complexitate O(n + m)
void dfs(int nod)
{
    viz[nod] = 1;
    for(int i=0;i<g[nod].size();i++)
    {
     if(viz[g[nod][i]] == 0)
        dfs(g[nod][i]);
    }
    st.push(nod);
}
int main()
{
    int n, m, i, x, y;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
       fin>>x>>y;
       g[x].push_back(y);
    }
    for(i =1;i<=n;i++)
    {
        if(viz[i]==0)
            dfs(i);
    }
    while(!st.empty())
    {
       x = st.top();
       st.pop();
       fout<<x<<" ";
    }
    fout<<"\n";
    return 0;
}