#include <fstream>
#include <vector>
#include <deque>

using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int grad[50002];
vector <int> graph[50002];
int v[50002];

void sortt()
{
    int ps=1,pi=v[0],nod;
    while(ps<=pi)
    {
        nod=v[ps++];
        for(int i=0;i<graph[nod].size();++i)
        {
            int vee=graph[nod][i];
            --grad[vee];
            if(grad[vee]==0)
                v[++pi]=vee;
        }
    }
}

int main()
{
    int m,n;
    f>>n>>m;
    int x,y;
    for(int i=1;i<=m;++i)
    {
        f>>x>>y;
        graph[x].push_back(y);
        grad[y]++;
    }
    for(int i=1;i<=n;++i)
        if(grad[i]==0)
            v[++v[0]]=i;
    sortt();
    for(int i=1;i<=n;++i)
        g<<v[i]<<' ';
    return 0;
}