#include <fstream>

using namespace std;

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

const int N = 50001, M = 100001;

int lst[N], urm[2 * M], vf[2 * M];
int d[N], q[N];
int nrp[N] = {0};
bool viz[N];
int n, nr = 0, dr = -1;

void adauga(int x, int y)
{
    //il adauga pe y in lista de adiacenta a lui x
    ++nr;
    vf[nr] = y;
    urm[nr] = lst[x];
    lst[x] = nr;
    nrp[y]++;
}

void dfs(int x)
{
    viz[x] = true;
    for(int p = lst[x]; p != 0; p = urm[p])
    {
        int y = vf[p];
        if(!viz[y])
        {
            dfs(y);
        }
        nrp[y]--;
        if(nrp[y] == 0)
        {
            q[++dr] = y;
        }
    }
}

int main()
{
    int m;
    in >> n >> m;
    int x, y;
    for(int i = 0; i < m; i++)
    {
        in >> x >> y;
        adauga(x, y);
    }
    int x0;
    for(int i = 1; i <= n; i++)
    {
        if(nrp[i] == 0)
        {
            x0 = i;
        }
    }
    out << x0 << ' ';
    dfs(x0);
    while(dr >= 0)
    {
        out << q[dr--] << ' ';
    }
    return 0;
}