#include <bits/stdc++.h>

using namespace std;

const int kNmax = 5e4 + 5;

vector<int> adj[kNmax];
bool visited[kNmax];
vector<int> topsort;

void dfs(int source) {
    visited[source] = true;
    for(int vecin : adj[source]) {
        if(!visited[vecin])
            dfs(vecin);
    }
    topsort.push_back(source);
}

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

    int n, m;
    fin>>n>>m;

    for(int i = 1; i <= m; i++) {
        int x, y;
        fin>>x>>y;
        adj[x].push_back(y);
    }

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

     for(int i = topsort.size() - 1; i >= 0; i--) {
        fout<<topsort[i]<<" ";
    }

    return 0;
}