#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

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

vector <vector <int>> v;
vector <bool> visited;
vector <int> topsort;
int n, m;

void read() {
    f >> n >> m;
    v = vector <vector <int>> (n + 1);
    visited = vector <bool> (n + 1);
    int x, y;
    for(int i = 1; i <= m; ++i) {
        f >> x >> y;
        v[x].push_back(y);
    }
}

void dfs(int node) {
    visited[node] = true;
    for(const int& neighbour : v[node])
        if(!visited[neighbour])
            dfs(neighbour);
    topsort.push_back(node);
}

int main()
{
    read();
    for(int i = 1; i <= n; ++i)
        if(!visited[i])
            dfs(i);
    for(auto it = topsort.rbegin(); it != topsort.rend(); ++it)
        g << *it << " ";
}