#include <fstream>
#include <vector>

const int NMAX = 50004;

using namespace std;

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

int N,M,x,y;
int gradInt[NMAX];
int Q[NMAX];
vector <int> v[NMAX];

void sortare()
{
    for (int i = 1; i <= N; ++i)
    {
        if (gradInt[i] == 0)
            Q[++Q[0]] = i;
    }

    for (int i = 1; i <= N; ++i)
    {
        int nod = Q[i];
        for (int i = 0; i < v[nod].size(); ++i)
        {
            int vecin = v[nod][i];
            gradInt[vecin]--;
            if (gradInt[vecin] == 0)
            {
                Q[++Q[0]] = vecin;
            }
        }
    }
}

int main()
{
    f >> N >> M;
    for (int i = 1; i <= M; ++i)
    {
        f >> x >> y;
        v[x].push_back(y);
        gradInt[y]++;
    }

    sortare();

    for (int i = 1; i <= N; ++i)
    {
        g << Q[i] << " ";
    }

    f.close();
    g.close();
    return 0;
}