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

using namespace std;

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

vector < vector < int> > adj;
vector <int> viz;

stack<int> st;

void DFS(int nod){

    viz[nod] = 1;

    for(int i : adj[nod])
    {
        if(viz[i]==0){
            viz[i] = 1;
            DFS(i);
        }

    }
    st.push(nod);
}

int nr = 0;
int n,m;

int main()
{
    fin>>n >>m;

    adj.resize(n+5);
    viz.resize(n+5);

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

    for (int i = 1; i<=n; i++){
        if(viz[i]==0) {
            DFS(i);
        }
    }
    while (!st.empty()){
        fout<<st.top()<<" ";
        st.pop();
    }
    return 0;
}