#include <cstdio>
#include <algorithm>
#include <vector>


std::vector<int> gph[50000];
int n, m, x, y;
int q[50000], ext_deg[50000];


int main(){

    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);

    scanf("%d%d", &n, &m);
    for (int i = 0; i < m; ++i)
    {
        scanf("%d%d", &x, &y);
        gph[x].push_back(y);
        ext_deg[y]++;
    }

    x = 1;
    for (int i = 1; i <= n; ++i)
        if (ext_deg[i] == 0)
            q[x++] = i;

    for (int i = 1; i <= n; ++i)
    {
        y = q[i];
        for (const auto& it : gph[y])
        {
            ext_deg[it]--;
            if (ext_deg[it] == 0)
                q[x++] = it;
        }
    }

    for (int i = 1; i <= n; ++i)
        printf("%d ", q[i]);

		
	return 0;
}