#include <vector>
#include <fstream>
#include <stack>
#include <iostream>
using namespace std;
const int N = 50000;
vector <int> a[N + 1];
bool viz[N + 1];
stack<int>stiva;
int n;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
void dfs(int x) {
    viz[x] = true;
    for (auto y : a[x]) {
        if (!viz[y]) {
            dfs(y);
        }
    }
    stiva.push(x);
}
int main()
{
    int m;
    in >> n >> m;
    for (int i = 0; i < m; i++)
    {
        int y, x;
        in >> x >> y;
        a[x].push_back(y);
    }
    for (int i = 1; i <= n; i++)
    {
        if (!viz[i]) {
            dfs(i);
        }
    }
    while (!stiva.empty()) {
        out << stiva.top() << " ";
        stiva.pop();
    }
    in.close();
    out.close();
    return 0;
}