#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

const int NMAX = 50001;
const int MMAX = 100001;

int q[NMAX], nrp[NMAX], lst[NMAX], urm[MMAX], nr, vf[MMAX], n, m, x, y, s, p;

void adauga(int x, int y)
{
    nrp[y]++;
    ++nr;
    vf[nr] = y;
    urm[nr] = lst[x];
    lst[x] = nr;
}

void bfs()
{
    int st = 0, dr = -1;
    for(int i = 1; i <= n; i++)
    {
        if(nrp[i] == 0)
        {
            q[++dr] = i;
        }
    }
    while(st <= dr)
    {
        x = q[st++];
        fout << x << " ";
        for(p = lst[x]; p != 0; p = urm[p])
        {
            y = vf[p];
            nrp[y]--;
            if(nrp[y] == 0)
            {
                q[++dr] = y;
            }
        }
    }
}

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        fin >> x >> y;
        adauga(x, y);
    }
    bfs();

    fin.close();
    fout.close();
    return 0;
}