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

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

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

void init() {
    v = vector <vector <int>> (n + 1);
    visited = vector <bool> (n + 1);
}

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

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

void solve() {
    dfs(1);
    for(int i = 2; i <= n; i ++)
        if(!visited[i])
            dfs(i);
}

void print() {
    for(auto it = topsort.rbegin(); it != topsort.rend(); ++it)
        fout << *it << " ";
}

int main() {
    read();
    solve();
    print();
}