#include <iostream>
#include <fstream>

using namespace std;

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

const int N = 50001;
const int M = 100001;
int n, m, nr, x, y, st, dr;
int d[N], q[N], vf[2*M], lst[N], urm[2*M], nrp[N];

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

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

    while(st <= dr)
    {
        x = q[st++];
        out<<x<<' ';
        for(int p=lst[x]; p!=0; p=urm[p])
        {
            y = vf[p];
            nrp[y] --;
            if(nrp[y] == 0)
            {
                q[++dr] = y;
            }
        }
    }
    return 0;
}