#include <bits/stdc++.h>
using namespace std;

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

int n, m;
vector<int> g[50005], nodes;
bool v[50005];

void dfs(int x) {
    v[x] = true;
    for(auto next: g[x])
        if(!v[next])
            dfs(next);
    nodes.push_back(x);
}

int main() {
    fin >> n >> m;
    while(m--) {
        int u,v ;
        fin >> u>> v;
        g[u].push_back(v);
    }
    for(int i = 1; i <= n; i++)
        if(!v[i])
            dfs(i);
    for(int i = nodes.size()-1; i >= 0; i--)
        fout << nodes[i] << ' ';
}