#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

const int NMAX = 5 * 1e4 + 5;

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

vector <int> g[NMAX];
vector <int> nodes;
bool viz[NMAX];

void dfs(int node)
{
    viz[node] = 1;
    for(auto x: g[node]) {
        if(viz[x] == 0) {
            dfs(x);
        }
    }
    nodes.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(viz[i] == 0) {
            dfs(i);
        }
    }
    reverse(nodes.begin(), nodes.end());
    for(auto x: nodes)
        cout << x << " ";
    cout << "\n";
    return 0;
}