#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
using namespace std;
ifstream fin("repetat.in");
ofstream fout("repetat.out");

const int LMAX = 50005;
vector<int> L[LMAX];
vector<int> order;
bool viz[LMAX];

void dfs(int node) {
    for (int vec : L[node]) {
        if (!viz[vec]) {
            viz[vec] = true;
            dfs(vec);
        }
    }
    order.push_back(node);
}

int main() {
    int n, m, x, y;
    fin>>n>>m;
    while (m--) {
        fin>>x>>y;
        L[x].push_back(y);
    }
    vector<int> newnode(n+1);
    for (int i = 1; i <= n; i++) {
        if (!viz[i]) dfs(i);
    }
    reverse(order.begin(), order.end());
    for (int i = 0; i < n; i++) {
        fout<<order[i]<<" ";
    }



    fin.close();
    fout.close();
    return 0;
}