#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m,grad[100005],x,y,first,last, q[100005];
vector <int> M[100005];

int main()
{
    int i,j,k;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        M[x].push_back(y);
        grad[y]++;
    }
    first = 1;
    last = 0;
    for(i=1;i<=n;i++)
    {
        if(!grad[i])
            q[++last]=i;
    }
    while(first <= last)
    {
        k = q[first++];
        fout<<k<<' ';
        for(j=0;j<M[k].size();j++)
            {
                grad[M[k][j]]--;
                if(!grad[M[k][j]])
                    q[++last] = M[k][j];
            }
    }
    return 0;
}