#include <fstream>
#include <vector>
#include <queue>

using namespace std;
ifstream fin ("sortaret.in");
ofstream fout ("sortaret.out");
int n, m, i, x, y, u, d[50005];
vector <int> v[50005];
queue <int> q;
int main()
{
    fin >> n >> m;
    for(i=1;i<=m;i++)
    {
        fin >> x >> y;
        v[x].push_back(y);
        d[y]++;
    }
    for(i=1;i<=n;i++)
        if(d[i]==0)
            q.push(i);
    while(!q.empty())
    {
        u=q.front();
        q.pop();
        fout << u << ' ';
        for(i=0;i<v[u].size();i++)
        {
            d[v[u][i]]--;
            if(d[v[u][i]]==0)
                q.push(v[u][i]);
        }
    }
    return 0;
}