#include <bits/stdc++.h>
#define ll long long
#define MAXN 50001
using namespace std;

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

vector<int> v[MAXN];
vector<int> sol(MAXN);
bitset<MAXN> visited;

int k;
void dfs(int node) {
    visited[node] = 1;
    for(int i = 0; i < v[node].size(); i++) {
        int neighbour = v[node][i];
        if(!visited[neighbour])
            dfs(neighbour);
    }
    sol[++k] = node;
}

int main() {
    int n, m;
    fin >> n >> m;

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

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

    for(int i = n; i >= 1; i--)
        fout << sol[i] << ' ';

    return 0;
}