//ALEXANDRU MICLEA

#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <map>
#include <set>
#include <unordered_map>
#include <time.h>
#include <iomanip>
#include <deque>
#include <math.h>
#include <cmath>
#include <assert.h>
#include <stack>
#include <bitset>
#include <random>
#include <chrono>
#include <assert.h>

using namespace std;

#include <fstream>
//ifstream cin("input.in"); ofstream cout("output.out");
ifstream cin("sortaret.in"); ofstream cout("sortaret.out");

//VARIABLES

vector<vector <int>> gr(50005);
vector <int> ans;
int used[50005];

//FUNCTIONS

void dfs(int nod) {
    used[nod] = true;

    for (auto& x : gr[nod]) {
        if (!used[x])dfs(x);
    }

    ans.push_back(nod);
}

//MAIN
int main() {

    int n, m; cin >> n >> m;

    for (int i = 1; i <= m; i++) {
        int x, y;
        cin >> x >> y;

        gr[x].push_back(y);
    }

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

    reverse(ans.begin(), ans.end());

    for (auto& x : ans) cout << x << ' ';

    return 0;
}