#include <bits/stdc++.h>
#define ll long long
//#define int ll
using namespace std;
ifstream in ("sortaret.in");
ofstream out ("sortaret.out");
int n, m;
vector <int> ans;
vector <int> v[50001];
int value[50001];
queue <int> q;
main()
{
    in >> n >> m;
    for (int i = 1;i<=m;++i)
    {
        int a, b;
        in >> a >> b;
        v[a].push_back(b);
        value[b]++;
    }
    for (int i = 1;i<=n;++i)
        if (!value[i])
            q.push(i);
    while (!q.empty())
    {
        int nod = q.front();
        ans.push_back(nod);
        q.pop();
        for (auto i:v[nod])
        {
            value[i]--;
            if (!value[i])
                q.push(i);
        }
    }
    for (auto i:ans)
        out << i << ' ';
    return 0;
}