#include <fstream>
#include <vector>

using namespace std;

vector<int> adj[100002];
vector<int> s;
bool viz[50002];
int N, M;

void dfs(int nod) {
    viz[nod] = true;
    for (int x : adj[nod]) {
        if (!viz[x])
            dfs(x);
    }
    s.push_back(nod);
}

int main()
{
    ifstream f("sortaret.in");
    ofstream g("sortaret.out");
    f >> N >> M;
    for (int i = 1; i <= M; i++) {
        int x, y;
        f >> x >> y;
        adj[y].push_back(x);
    }
    for (int i = 1; i <= N; i++) {
        if (!viz[i])
            dfs(i);
    }
    for (vector<int>::iterator it = s.begin(); it != s.end(); it++) {
        g << *it << ' ';
    }
    f.close();
    g.close();
    return 0;
}