#include <algorithm>
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
const int maxn = 50005;
vector <int> inv[maxn];
vector <int> v[maxn];
vector <int> sol;
int degree[maxn];
queue <int> q;
int main()
{
    int n, m;
    in >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        in >> x >> y;
        v[x].push_back(y);
        inv[y].push_back(x);
        degree[x]++;
    }
    for(int i = 1; i <= n; i++)
        if(degree[i] == 0)
            q.push(i);
    while(!q.empty())
    {
        int nod = q.front();
        q.pop();
        sol.push_back(nod);
        for(auto it : inv[nod])
        {
            degree[it]--;
            if(degree[it] == 0)
                q.push(it);
        }
    }
    reverse(sol.begin(), sol.end());
    for(auto it : sol)
        out << it << " ";
    out << "\n";
    return 0;
}