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

using namespace std;

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

int n, m, x, y;
vector<int> graph[100000];
int marked[100000];
vector<int> rez;
void dfs(int k){
    marked[k] = 1;
    int lim = graph[k].size();
    for(int i = 0; i<lim; i++)
        if(!marked[graph[k][i]]){
            dfs(graph[k][i]);
        }
    rez.push_back(k);
}

int main()
{
    fin>>n>>m;
    for(int i = 0; i<m; i++){
        fin>>x>>y;
        graph[x].push_back(y);
    }

    for(int i = 1; i<=n; i++){
        if(!marked[i]){
            dfs(i);
        }
    }
    for(int i = rez.size()-1; i>=0; i--) fout<<rez[i]<<' ';
    return 0;
}