#include <fstream>
#include <vector>

using namespace std;

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

const int nmax = 50005;
vector<int> g[nmax];
bool visited[nmax];
vector<int> sorted;

void dfs(int node) {
    for(int pretender : g[node]) {
        if(!visited[pretender]) {
            visited[pretender] = 1;
            dfs(pretender);
        }
    }
    sorted.push_back(node);
}

int main() {
    int n,m;
    cin >> n >> m;
    for(int i = 1;i <= m;i ++) {
        int x,y;
        cin >> x >> y;
        g[x].push_back(y);
    }
    for(int i = 1;i <= n;i ++) {
        if(!visited[i]) {
            visited[i] = 1;
            dfs(i);
        }
    }
    for(int i = n-1;i >= 0;i --)
        cout << sorted[i] << " ";

    return 0;
}