#include <bits/stdc++.h>

using namespace std;

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

int n, m;
vector<int> G[100010];
vector<int> ans;
int vis[100001];

void dfs(int nod) {
    vis[nod] = 1;
    for(auto nodnou : G[nod]) {
        if(!vis[nodnou]) {
            dfs(nodnou);
        }
    }
    ans.push_back(nod);
}

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

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

    reverse(ans.begin(), ans.end());
    for(auto x : ans) fout << x << ' ';

}