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

using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,s;
vector< vector <int> > v;
vector< int > a,sol;
queue <int> coada;
int main()
{
    int x,y,i,nr;
    f>>n>>m;
    v.resize(n+1);
    a.resize(n+1);
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        v[y].push_back(x);
        a[x]++;
    }
    for(i=1;i<=n;i++)
    {
        if(a[i]==0)
        {
            coada.push(i);
            sol.push_back(i);
        }
    }
    while(!coada.empty())
    {
        x=coada.front();
        coada.pop();
        nr=v[x].size();
        for(i=0;i<nr;i++)
        {
            a[v[x][i]]--;
            if(a[v[x][i]]==0)
            {
                coada.push(v[x][i]);
                sol.push_back(v[x][i]);
            }
        }
    }
    for(i=n-1;i>=0;i--)
    {
        g<<sol[i]<<" ";
    }
    return 0;
}