#include <fstream>
#include <queue>
using namespace std;
ifstream cin ("sortaret.in");
ofstream cout ("sortaret.out");
vector <int> lista[50010];
queue <int> q;
int grad[50010],rez[50010];
int main()
{
    int n,m,i,k,x,y,val;
    cin>>n>>m;
    for (i=1; i<=m; i++)
    {
        cin>>x>>y;
        lista[x].push_back(y);
        grad[y]++;
    }
    k=0;
    for (i=1; i<=n; i++)
        if (grad[i]==0)
        {
            q.push(i);
            k++;
            rez[k]=i;
        }
    while (k<n)
    {
        val=q.front();
        q.pop();
        for (i=0; i<lista[val].size(); i++)
        {
            if (grad[lista[val][i]]>0)
                grad[lista[val][i]]--;
            if (grad[lista[val][i]]==0)
            {
                k++;
                rez[k]=lista[val][i];
                q.push(lista[val][i]);
            }
        }
    }
    for (i=1; i<=k; i++)
        cout<<rez[i]<<" ";
    return 0;
}