#include <bits/stdc++.h>

using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
#define nmax 50005
int i,n,nr,x,y,m,t[nmax],rasp[nmax];
vector<int> g[nmax];
queue<int>q;

void sortare()
{
    for(i=1; i<=n; i++)
    {
        if(!t[i])
        {
            q.push(i);
            rasp[++nr]=i;

        }
    }
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for(i=0; i<g[x].size(); i++)
        {
            y=g[x][i];
            t[y]--;
            if(t[y]==0)
            {
                rasp[++nr]=y;
                q.push(y);
            }

        }
    }
    for(i=1; i<=nr; i++)fout<<rasp[i]<<" ";
}
int main()
{
    fin>>n>>m;
    for(i=1; i<=m; i++)
    {
        fin>>x>>y;
        g[x].push_back(y);
        t[y]++;

    }
    sortare();
    return 0;
}