#include <fstream>
#define N 50002
#include <vector>

using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");

int grad[N],v[N];
vector <int> graph[N];

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