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

using namespace std;

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

vector<int> grad(50001, 0);
vector< vector <int> > v(50001);
vector<int> sol;

vector<bool> viz(50001, false);

void dfs(int nod) {
    viz[nod] = true;
    for(auto vecin : v[nod])
    {
        if (!viz[vecin]) {
            dfs(vecin);
            sol.push_back(vecin);
        }
        
    }
}

void sort_top(int n) {
    for(int i = 1; i <= n; i++)
    {
        if (!viz[i]) {
            dfs(i);
            sol.push_back(i);
        }
        
    }
}

int main() {
    int n, m;
    in >> n >> m;
    int x, y;
    for(int i = 0; i < m; i++)
    {
        in >> x >> y;
        v[x].push_back(y);
    }
    sort_top(n);
    reverse(sol.begin(), sol.end());
    for(auto&& nod : sol)
    {
        out << nod << " ";
    }
    
    return 0;
}