#include <bits/stdc++.h>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector<int>v[50001];
queue<int>q;
vector<int>top_sort;
int intern_degree[50001];
int n, m;
vector<int> bfs(int nod) {
    vector<int>top_sort;
    top_sort.clear();
    for(int i = 1; i <= n; i++)
        if(intern_degree[i] == 0)
            q.push(i);
    while(!q.empty()) {
        int node = q.front();
        q.pop();
        top_sort.push_back(node);
        for(auto next: v[node]) {
            intern_degree[next]--;
            if(intern_degree[next] == 0)
                q.push(next);
        }
    }
    return top_sort;
}
int main()
{
    f >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        f >> x >> y;
        v[x].push_back(y);
        intern_degree[y]++;
    }
    top_sort = bfs(1);
    for(auto node : top_sort)
        g << node << ' ';
    return 0;
}