#include <fstream>
#include <vector>

using namespace std;

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

const int N = 50005;
vector <int> g[N];

int grd[N], c[N];


int main()
{
    int n, m, i, a, b;
    in >> n >> m;
    for(i = 1; i <= m; i++)
    {
        in >> a >> b;
        g[a].push_back(b);
        grd[b]++;
    }
    int p = 1, u = 0;
    for(i = 1; i <= n; i++)
        if(grd[i] == 0)
            {
                u++;
                c[u] = i;
            }
    int nod;
    while(p <= u)
    {
        nod = c[p];
        p++;
        out << nod << " ";
        for(i = 0; i <g[nod].size(); i++)
        {
            grd[g[nod][i]] --;
            if(grd[g[nod][i]] == 0)
            {
                u++;
                c[u] = g[nod][i];
            }

        }
    }



    return 0;
}