#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> G(n);
    vector<int> deg(n);
    for (int i = 0; i < m; ++i) {
        int a, b;
        scanf("%d %d", &a, &b);
        a--; b--;
        G[a].emplace_back(b);
        deg[b]++;
    }
    stack<int> S;
    for (int i = 0; i < n; ++i) {
        if(!deg[i]) S.emplace(i);
    }
    vector<int> ans;
    while(!S.empty()){
        int x = S.top(); S.pop();
        ans.emplace_back(x);
        for (auto &&i : G[x]) {
            if(!(--deg[i])) S.emplace(i);
        }
    }
    for (auto &&j : ans) cout << j+1 << "\n";
    return 0;
}
